Sciweavers

74 search results - page 1 / 15
» How Good is Almost Perfect
Sort
View
AAAI
2008
13 years 7 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
DAM
1999
114views more  DAM 1999»
13 years 4 months ago
Perfect and Almost Perfect Sequences
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
Dieter Jungnickel, Alexander Pott
MM
2009
ACM
245views Multimedia» more  MM 2009»
13 years 11 months ago
Concept detectors: how good is good enough?
Today, semantic concept based video retrieval systems often show insufficient performance for real-life applications. Clearly, a big share of the reason is the lacking performance...
Robin Aly, Djoerd Hiemstra
ICRA
2007
IEEE
129views Robotics» more  ICRA 2007»
13 years 11 months ago
Robust Distributed Coverage using a Swarm of Miniature Robots
Abstract— For the multi-robot coverage problem deterministic deliberative as well as probabilistic approaches have been proposed. Whereas deterministic approaches usually provide...
Nikolaus Correll, Alcherio Martinoli
CORR
2011
Springer
135views Education» more  CORR 2011»
12 years 12 months ago
How to make the most of a shared meal: plan the last bite first
If you are sharing a meal with a companion, how best to make sure you get your favourite fork-fulls? Ethiopian Dinner is a game in which two players take turns eating morsels from ...
Lionel Levine, Katherine E. Stange