1047 search results - page 20 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
IWMMDBMS
1996
13 years 9 months ago
1996
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
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...
EPS
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. In this paper we describe EvoCK, a new approach to the application of genetic programming (GP) to planning. This approach starts with a traditional AI planner (PRODIGY)an...
GCC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Search is until now a difficult problem in peer-to-peer (P2P) filesharing systems. In this paper, we propose to use adaptive metadata spreading to make search in P2P netw...
IWANN
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. The Frequency Assignment Problem (FAP) is a very important problem of practical interest. This work compares several evolutionary approaches to this problem, based both i...