Sciweavers

4426 search results - page 322 / 886
» Concurrent Constraint Programming
Sort
View
SODA
2008
ACM
71views Algorithms» more  SODA 2008»
15 years 8 months ago
Two-phase greedy algorithms for some classes of combinatorial linear programs
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 ...
Ulrich Faigle, Britta Peis
IPCO
2010
153views Optimization» more  IPCO 2010»
15 years 4 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
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...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
LPNMR
2007
Springer
16 years 24 days ago
Programming Applications in CIFF
We show how to deploy the CIFF System 4.0 for abductive logic programming with constraints in a number of applications, ranging from combinatorial applications to web management. W...
Paolo Mancarella, Fariba Sadri, Giacomo Terreni, F...
ORL
2008
50views more  ORL 2008»
15 years 6 months ago
Exploiting equalities in polynomial programming
We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (ty...
Javier Peña, Juan Carlos Vera, Luis F. Zulu...
FLOPS
2010
Springer
15 years 11 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann