4229 search results - page 518 / 846 » On the Optimality of Spiral Search |
172
click to vote
AIPS
2006
15 years 8 months ago
2006
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
174
click to vote
NIPS
2003
15 years 8 months ago
2003
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...
149
click to vote
AIPS
1998
15 years 8 months ago
1998
We present the application of the Planning by Rewriting PbR framework to query planning in distributed and heterogeneous environments. PbR is a new paradigm for e cient high-quali...
199
click to vote
ICGA
1993
15 years 8 months ago
1993
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
207
click to vote
CSC
2009
15 years 7 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...