Sciweavers

1244 search results - page 69 / 249
» Searching in Higher Dimension
Sort
View
CEC
2008
IEEE
13 years 12 months ago
Investigation of simply coded evolutionary artificial neural networks on robot control problems
One of the advantages of evolutionary robotics over other approaches in embodied cognitive science would be its parallel population search. Due to the population search, it takes a...
Yoshiaki Katada, Jun Nakazawa
IPL
2002
119views more  IPL 2002»
13 years 9 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
HICSS
2002
IEEE
113views Biometrics» more  HICSS 2002»
14 years 2 months ago
Persona: A Contextualized and Personalized Web Search
Abstract— Recent advances in graph-based search techniques derived from Kleinberg’s work [1] have been impressive. This paper further improves the graph-based search algorithm ...
Francisco Tanudjaja, Lik Mu
COMPGEOM
2010
ACM
14 years 3 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
SIGIR
2006
ACM
14 years 3 months ago
Learning user interaction models for predicting web search result preferences
Evaluating user preferences of web search results is crucial for search engine development, deployment, and maintenance. We present a real-world study of modeling the behavior of ...
Eugene Agichtein, Eric Brill, Susan T. Dumais, Rob...