Sciweavers

1884 search results - page 167 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 4 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
105
Voted
GECCO
2004
Springer
15 years 8 months ago
On the Choice of the Population Size
Abstract. Evolutionary Algorithms (EAs) are population-based randomized optimizers often solving problems quite successfully. Here, the focus is on the possible effects of changin...
Tobias Storch
105
Voted
DEXA
2008
Springer
120views Database» more  DEXA 2008»
15 years 4 months ago
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
Piotr Kolaczkowski
ACE
2004
258views Education» more  ACE 2004»
15 years 4 months ago
Using a Maze Case Study to Teach Object-Oriented Programming and Design Patterns
In order to teach object-oriented design and programming in introductory computer science it is imperative to teach objects from the very beginning of the course. The use of inter...
Chris Nevison, Barbara Wells
CCCG
1996
15 years 3 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...