5090 search results - page 805 / 1018 » Constructing Strategies for Programming |
152
click to vote
STACS
2005
Springer
16 years 19 hour ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
174
click to vote
SENSYS
2003
ACM
15 years 11 months ago
2003
ACM
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
168
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
188
click to vote
3DIM
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper, we report on recent extensions to a surface matching algorithm based on local 3-D signatures. This algorithm was previously shown to be effective in view registrati...
147
click to vote
AAAI
2007
15 years 8 months ago
2007
Concurrent action execution is important for plan-length minimization. However, action specifications are often limited to avoid conflicts arising from precondition/effect inter...