817 search results - page 93 / 164 » Exact solutions to linear programming problems |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
GMP
2010
IEEE
14 years 1 days ago
2010
IEEE
Abstract. In isogeometric analysis (IGA for short) framework, computational domain is exactly described using the same representation as that employed in the CAD process. For a CAD...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
MJ
2007
13 years 7 months ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...