17366 search results - page 202 / 3474 » New Revision Algorithms |
158
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
112
Voted
ICRA
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper introduces a novel heuristic nmdmap method for path planning, one that is inspired by the Vomnoi diagmm concept, but easiZy applicable to geneml configurntion spaces. T...
140
Voted
CPM
1999
Springer
15 years 8 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
133
click to vote
CVPR
2004
IEEE
15 years 8 months ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
169
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...