Sciweavers

655 search results - page 129 / 131
» Evolving Heuristics for Planning
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 9 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
ATAL
2009
Springer
15 years 4 months ago
Sensitivity analysis for distributed optimization with resource constraints
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
Emma Bowring, Zhengyu Yin, Rob Zinkov, Milind Tamb...
89
Voted
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
15 years 4 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
78
Voted
P2P
2007
IEEE
161views Communications» more  P2P 2007»
15 years 3 months ago
The BitCod Client: A BitTorrent Clone using Network Coding
Network coding is an emerging field of research with sound and mature theory supporting it. Recent works shows that it has many benefits like improved fault tolerance, higher ...
Danny Bickson, Roy Borer
CP
2007
Springer
15 years 3 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner