Sciweavers

4198 search results - page 325 / 840
» In search of lost time
Sort
View
GECCO
2004
Springer
16 years 6 days 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
ADBIS
2003
Springer
173views Database» more  ADBIS 2003»
16 years 2 days ago
UCYMICRA: Distributed Indexing of the Web Using Migrating Crawlers
Due to the tremendous increase rate and the high change frequency of Web documents, maintaining an up-to-date index for searching purposes (search engines) is becoming a challenge....
Odysseas Papapetrou, Stavros Papastavrou, George S...
ICIP
2002
IEEE
15 years 11 months ago
Evaluation of reproducibility for manual and semi-automated feature extraction in CT and MR images
Three methods for extraction and quantitative measurement of features in CT and MR images are examined: hand tracing, semi-automated tracing using the livewire graph search algori...
Edward A. Ashton, Larry Molinelli, Saara Totterman...
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
15 years 11 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
IPPS
2000
IEEE
15 years 11 months ago
On Identifying Strongly Connected Components in Parallel
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
Lisa Fleischer, Bruce Hendrickson, Ali Pinar