Sciweavers

7522 search results - page 79 / 1505
» Spacing memetic algorithms
Sort
View
PE
2000
Springer
118views Optimization» more  PE 2000»
15 years 9 days ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
227
Voted
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 25 days ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
113
Voted
ADHOCNOW
2003
Springer
15 years 5 months ago
Space-Time Routing in Ad Hoc Networks
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
Henri Dubois-Ferrière, Matthias Grossglause...
93
Voted
DASFAA
2008
IEEE
109views Database» more  DASFAA 2008»
15 years 7 months ago
Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
Hyun-Jeong Seok, Gang Qian, Qiang Zhu, Alexander R...
127
Voted
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 6 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman