Sciweavers

4860 search results - page 134 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
NIPS
1992
15 years 4 months ago
Feudal Reinforcement Learning
This paper describes the adaption and application of an algorithm called Feudal Reinforcement Learning to a complex gridworld navigation problem. The algorithm proved to be not ea...
Peter Dayan, Geoffrey E. Hinton
WSNA
2003
ACM
15 years 8 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
16 years 13 days ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 3 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
15 years 9 months ago
The multi-objective next release problem
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objecti...
Yuanyuan Zhang, Mark Harman, S. Afshin Mansouri