output
20122026
most citedA Survey on Load Balancing Algorithms for VM Placement in Cloud Computing

180 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.SCShow all

5 papers · 1 filter

cs.SC2018★ 1 cited

Computing an LLL-reduced basis of the orthogonal lattice

Jingwei Chen, Damien Stehlé, Gilles Villard

As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix…

cs.SC2017

A Special Homotopy Continuation Method For A Class of Polynomial Systems

Yu Wang, Wenyuan Wu, Bican Xia

A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a speci…

cs.SC2016

Finding best possible constant for a polynomial inequality

Lu Yang, Ju Zhang

Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest n…

cs.SC2014★ 25 cited

Problem formulation for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition

Matthew England, Russell Bradford, Changbo Chen +3

Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advan…

cs.SC2014★ 31 cited

Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains

R. Bradford, C. Chen, J. H. Davenport +3

A new algorithm to compute cylindrical algebraic decompositions (CADs) is presented, building on two recent advances. Firstly, the output is truth table invariant (a TTICAD) meanin…