Sciweavers

1068 search results - page 29 / 214
» On Space Bounded Server Algorithms
Sort
View
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
14 years 1 months ago
Anytime, Dynamic Planning in High-dimensional Search Spaces
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
Dave Ferguson, Anthony Stentz
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
14 years 8 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 7 months ago
Multi-Armed Bandits in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
14 years 21 days ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
RTA
1997
Springer
13 years 11 months ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Ana Paula Tomás, Miguel Filgueiras