Sciweavers

1983 search results - page 98 / 397
» Competitive graph searches
Sort
View
DAWAK
2001
Springer
14 years 11 days ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
FLAIRS
2001
13 years 9 months ago
A Reference Test Course for Urban Search and Rescue Robots
Oneapproachto measuringthe performanceof intelligent systemsis to developstandardizedor reproducibletests. Thesetests maybe in a simulatedenvironmentor in a physical test course.T...
Adam Jacoff, Elena Messina, John Evans
JIIS
2002
141views more  JIIS 2002»
13 years 7 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
14 years 2 months ago
A hybrid genetic algorithm for a variant of two-dimensional packing problem
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
Jin Kim, Byung Ro Moon
DAGSTUHL
1996
13 years 9 months ago
Self-Organizing Data Structures
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
Susanne Albers, Jeffery Westbrook