Sciweavers

309 search results - page 59 / 62
» Partial Move A*
Sort
View
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
13 years 10 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
AIPR
2004
IEEE
13 years 10 months ago
Feasibility Study for the Development of a Motion Imagery Quality Metric
The motion imagery community would benefit from the availability of standard measures for assessing image interpretability. The National Imagery Interpretability Rating Scale (NII...
John M. Irvine, Charles Fenimore, David M. Cannon,...
ATAL
2006
Springer
13 years 10 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
AVI
2008
13 years 9 months ago
Time2Hide: spatial searches and clutter alleviation for the desktop
The desktop metaphor aimed to create a working environment, which would resemble that of the user's desk. With information abundance this desktop is often cluttered with file...
George Lepouras, Aggelos Papatriantafyllou, Akrivi...
PODC
2010
ACM
13 years 8 months ago
On the computational power of oblivious robots: forming a series of geometric patterns
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have ...
Shantanu Das, Paola Flocchini, Nicola Santoro, Mas...