2398 search results - page 50 / 480 » Constraint Programming and Graph Algorithms |
112
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
123
click to vote
PPDP
2010
Springer
15 years 25 days ago
2010
Springer
Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develo...
140
click to vote
IPCO
2010
15 years 10 days ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
105
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
115
Voted
FSTTCS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...