Sciweavers

1091 search results - page 40 / 219
» On the temporal dimension of search
Sort
View
GECCO
2004
Springer
15 years 7 months ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
15 years 6 months ago
Benchmarking the NEWUOA on the BBOB-2009 function testbed
The NEWUOA which belongs to the class of Derivative-Free optimization algorithms is benchmarked on the BBOB-2009 noisefree testbed. A multistart strategy is applied with a maximum...
Raymond Ros
SIGIR
2011
ACM
14 years 4 months ago
Faster temporal range queries over versioned text
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
Jinru He, Torsten Suel
ECIR
2006
Springer
15 years 2 months ago
Clustering-Based Searching and Navigation in an Online News Source
The growing amount of online news posted on the WWW demands new algorithms that support topic detection, search, and navigation of news documents. This work presents an algorithm f...
Simón C. Smith, M. Andrea Rodríguez
76
Voted
AIPS
2009
15 years 2 months ago
Using Distance Estimates in Heuristic Search
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is...
Jordan Tyler Thayer, Wheeler Ruml