551 search results - page 83 / 111 » Continuous Search in Constraint Programming |
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
RECOMB
1998
Springer
13 years 12 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
CPAIOR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...