566 search results - page 33 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
CP
2005
Springer
15 years 6 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
126
click to vote
MATES
2009
Springer
15 years 7 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
82
Voted
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
128
click to vote
ISLPED
2006
ACM
15 years 6 months ago
2006
ACM
As semiconductor manufacturing technology scales to smaller device sizes, the power consumption of clocked digital ICs begins to increase. Dynamic voltage and frequency scaling (D...
100
click to vote
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract--Current multibeam satellite systems perform centralized power and carrier allocation assuming a Multi-Frequency Time Division Multiple Access (MF-TDMA) scheme with fixed ...