Sciweavers

182 search results - page 17 / 37
» Heuristics for Ordering Cue Search in Decision Making
Sort
View
ANOR
2007
80views more  ANOR 2007»
14 years 10 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
IS
2007
14 years 9 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
AIPS
2008
15 years 6 days ago
The Compression Power of Symbolic Pattern Databases
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
Marcel Ball, Robert C. Holte
ICRA
2009
IEEE
132views Robotics» more  ICRA 2009»
15 years 4 months ago
Smoothed Sarsa: Reinforcement learning for robot delivery tasks
— Our goal in this work is to make high level decisions for mobile robots. In particular, given a queue of prioritized object delivery tasks, we wish to find a sequence of actio...
Deepak Ramachandran, Rakesh Gupta
EUROSYS
2006
ACM
15 years 7 months ago
On the road to recovery: restoring data after disasters
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
Kimberly Keeton, Dirk Beyer 0002, Ernesto Brau, Ar...