Sciweavers

669 search results - page 93 / 134
» New Constraint Programming Approaches for the Computation of...
Sort
View
CP
2006
Springer
14 years 5 days ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
IOR
2006
173views more  IOR 2006»
13 years 8 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
AAAI
2000
13 years 9 months ago
Applying Learnable Evolution Model to Heat Exchanger Design
A new approach to evolutionary computation, called Learnable Evolution Model (LEM), has been applied to the problem of optimizing tube structures of heat exchangers. In contrast t...
Kenneth A. Kaufman, Ryszard S. Michalski
HPCA
2003
IEEE
14 years 8 months ago
Dynamic Voltage Scaling with Links for Power Optimization of Interconnection Networks
Originally developed to connect processors and memories in multicomputers, prior research and design of interconnection networks have focused largely on performance. As these netw...
Li Shang, Li-Shiuan Peh, Niraj K. Jha
CP
2007
Springer
14 years 2 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...