Sciweavers

944 search results - page 6 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
AIPS
2007
13 years 9 months ago
Cost-Sharing Approximations for h+
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
Vitaly Mirkis, Carmel Domshlak
INTERACT
2003
13 years 8 months ago
Usability Heuristics for Large Screen Information Exhibits
: This paper reports on current development of usability heuristics for large screen information exhibits. By basing the creation of such heuristics on real systems, and identifyin...
Jacob P. Somervell, Shahtab Wahid
HEURISTICS
2010
13 years 2 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 7 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
AAAI
2006
13 years 8 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons