Sciweavers

2252 search results - page 292 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
115
Voted
JC
2007
109views more  JC 2007»
15 years 3 months ago
Cubature formulas for function spaces with moderate smoothness
We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over t...
Michael Gnewuch, René Lindloh, Reinhold Sch...
116
Voted
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 3 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...
155
Voted
COLT
2010
Springer
15 years 1 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
129
Voted
BMCBI
2010
105views more  BMCBI 2010»
15 years 3 months ago
Effects of scanning sensitivity and multiple scan algorithms on microarray data quality
Background: Maximizing the utility of DNA microarray data requires optimization of data acquisition through selection of an appropriate scanner setting. To increase the amount of ...
Andrew Williams, Errol M. Thomson
117
Voted
PODS
1999
ACM
121views Database» more  PODS 1999»
15 years 7 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...