Sciweavers

2861 search results - page 111 / 573
» Constraint Programming
Sort
View
120
Voted
FOCS
1990
IEEE
15 years 5 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo
103
Voted
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 1 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
JMLR
2012
13 years 4 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
108
Voted
JCP
2008
178views more  JCP 2008»
15 years 1 months ago
Building Design Optimization Using Sequential Linear Programming
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...
Rekha Bhowmik
115
Voted
FLOPS
2008
Springer
15 years 3 months ago
Integrating Answer Set Reasoning with Constraint Solving Techniques
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...
Veena S. Mellarkod, Michael Gelfond