1566 search results - page 189 / 314 » Saving Space in a Time Efficient Simulation Algorithm |
176
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
184
click to vote
KES
1999
Springer
15 years 10 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
196
click to vote
INFOCOM
2006
IEEE
16 years 11 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
168
click to vote
CAV
2009
Springer
16 years 6 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
182
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...