10666 search results - page 1391 / 2134 » Quantum programming languages |
189
Voted
CP
2003
Springer
16 years 20 days ago
2003
Springer
We propose a two-level search strategy to solve a two dimensional circle packing problem. At the first level, a good enough packing algorithm called
180
Voted
CP
2003
Springer
16 years 20 days ago
2003
Springer
Abstract. In 1997 we presented ten challenges for research on satisfiability testing [1]. In this paper we review recent progress towards each of these challenges, including our o...
144
Voted
CP
2003
Springer
16 years 20 days ago
2003
Springer
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
191
Voted
CP
2003
Springer
16 years 20 days ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
131
click to vote
ICALP
2003
Springer
16 years 19 days ago
2003
Springer
Discounting the future means that the value, today, of a unit payoff is 1 if the payoff occurs today, a if it occurs tomorrow, a2 if it occurs the day after tomorrow,