Sciweavers

949 search results - page 85 / 190
» ISAC - Instance-Specific Algorithm Configuration
Sort
View
EUROPAR
2010
Springer
13 years 9 months ago
Ants in Parking Lots
Ants provide an attractive metaphor for robots that "cooperate" in performing complex tasks. What, however, are the algorithmic consequences of following this metaphor? ...
Arnold L. Rosenberg
AEI
2008
108views more  AEI 2008»
13 years 8 months ago
Combinatorial synthesis approach employing graph networks
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
Offer Shai, Noel Titus, Karthik Ramani
JMLR
2006
125views more  JMLR 2006»
13 years 8 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
IVS
2007
140views more  IVS 2007»
13 years 8 months ago
Fast point-feature label placement for dynamic visualizations
This paper describes a fast approach to automatic point label de-confliction on interactive maps. The general Map Labeling problem is NP-hard and has been the subject of much stud...
Kevin Mote
ALGORITHMICA
2000
76views more  ALGORITHMICA 2000»
13 years 8 months ago
Visibility-Based Planning of Sensor Control Strategies
Abstract. We consider the problem of planning sensor control strategies that enable a sensor to be automatically configured for robot tasks. In this paper we present robust and eff...
Amy J. Briggs, Bruce Randall Donald