Sciweavers

7522 search results - page 64 / 1505
» Spacing memetic algorithms
Sort
View
STACS
2010
Springer
15 years 7 months ago
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets
Using ε-bias spaces over F2, we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an NC2 algorithm (achieving the same parameters as [APY09]). We stu...
Vikraman Arvind, Srikanth Srinivasan
101
Voted
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 24 days ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
15 years 6 months ago
Anytime, Dynamic Planning in High-dimensional Search Spaces
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
Dave Ferguson, Anthony Stentz
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
15 years 6 months ago
Analyzing the effects of module encapsulation on search space bias
Modularity is thought to improve the evolvability of biological systems [18, 22]. Recent studies in the field of evolutionary computation show that the use of modularity improves...
Ozlem O. Garibay, Annie S. Wu
79
Voted
ICCAD
1997
IEEE
66views Hardware» more  ICCAD 1997»
15 years 4 months ago
Sequential optimisation without state space exploration
We propose an algorithm for area optimisation of sequential circuits through redundancy removal. The algorithm finds compatible redundancies by implying values over nets in the c...
Amit Mehrotra, Shaz Qadeer, Vigyan Singhal, Robert...