Sciweavers

315 search results - page 15 / 63
» A new heuristic to solve the one-warehouse N-retailer proble...
Sort
View
JVA
2006
IEEE
14 years 2 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
LPAR
2010
Springer
13 years 6 months ago
Automated Proof Compression by Invention of New Definitions
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
Jirí Vyskocil, David Stanovský, Jose...
UAI
2003
13 years 10 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
AIPS
2008
13 years 11 months ago
Unifying the Causal Graph and Additive Heuristics
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
Malte Helmert, Hector Geffner
HEURISTICS
2010
13 years 6 months ago
A shift sequence based approach for nurse scheduling and a new benchmark dataset
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
Peter Brucker, Edmund K. Burke, Timothy Curtois, R...