Sciweavers

283 search results - page 35 / 57
» Strategies to Minimize Problems in Global Requirements Elici...
Sort
View
105
Voted
FLAIRS
2008
15 years 2 months ago
Extending Nearest Neighbor Classification with Spheres of Confidence
The standard kNN algorithm suffers from two major drawbacks: sensitivity to the parameter value k, i.e., the number of neighbors, and the use of k as a global constant that is ind...
Ulf Johansson, Henrik Boström, Rikard Kö...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 5 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
83
Voted
ICRA
2003
IEEE
167views Robotics» more  ICRA 2003»
15 years 5 months ago
Local exploration: online algorithms and a probabilistic framework
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
Volkan Isler, Sampath Kannan, Kostas Daniilidis
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
15 years 5 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...
93
Voted
COLT
2008
Springer
15 years 1 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal