Sciweavers

727 search results - page 100 / 146
» Private approximation of search problems
Sort
View
FLAIRS
2003
13 years 11 months ago
Sample Complexity of Real-Coded Evolutionary Algorithms
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
Jian Zhang 0007, Xiaohui Yuan, Bill P. Buckles
AAAI
1996
13 years 11 months ago
Building Steady-State Simulators via Hierarchical Feedback Decomposition
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
Nicolas F. Rouquette
CEC
2008
IEEE
14 years 4 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
14 years 4 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
CIKM
2003
Springer
14 years 3 months ago
An approach for implicitly detecting information needs
Searchers can have problems devising queries that accurately express their, often dynamic, information needs. In this paper we describe an adaptive approach that uses unobtrusive ...
Ryen White, Joemon M. Jose, Ian Ruthven