Sciweavers

333 search results - page 34 / 67
» Speeding up moving-target search
Sort
View
86
Voted
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 2 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
71
Voted
FGCS
2006
82views more  FGCS 2006»
14 years 10 months ago
PGGA: A predictable and grouped genetic algorithm for job scheduling
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
Maozhen Li, Bin Yu, Man Qi
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
15 years 3 months ago
Hybrid Genetic Algorithms for Multi-Objective Optimisation of Water Distribution Networks
Abstract. Genetic algorithms have been a standard technique for engineers optimising water distribution networks for some time. However in recent years there has been an increasing...
Ed Keedwell, Soon-Thiam Khu
97
Voted
IEAAIE
2004
Springer
15 years 3 months ago
An Algorithm for Incremental Mode Induction
Learning systems have been devised as a way of overcoming the knowledge acquisition bottleneck in the development of knowledge-based systems. They often cast learning to a search p...
Nicola Di Mauro, Floriana Esposito, Stefano Ferill...
70
Voted
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
15 years 3 months ago
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...