Sciweavers

2099 search results - page 215 / 420
» Distributed constraint optimization with structured resource...
Sort
View
190
Voted
CPAIOR
2010
Springer
15 years 1 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
MICRO
2006
IEEE
73views Hardware» more  MICRO 2006»
15 years 9 months ago
Merging Head and Tail Duplication for Convergent Hyperblock Formation
VLIW and EDGE (Explicit Data Graph Execution) architectures rely on compilers to form high-quality hyperblocks for good performance. These compilers typically perform hyperblock f...
Bertrand A. Maher, Aaron Smith, Doug Burger, Kathr...
140
Voted
ICTAI
2010
IEEE
15 years 1 months ago
PKOPT: Faster k-Optimal Solution for DCOP by Improving Group Selection Strategy
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
Elnaz Bigdeli, Maryam Rahmaninia, Mohsen Afsharchi
MOR
2008
169views more  MOR 2008»
15 years 3 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
DASFAA
2007
IEEE
165views Database» more  DASFAA 2007»
15 years 7 months ago
Making the Most of Cache Groups
Cache groups are a powerful concept for database caching, which is used to relieve the backend database load and to keep referenced data close to the application programs at the &q...
Andreas Bühmann, Theo Härder