Sciweavers

1369 search results - page 242 / 274
» Lattice computations for random numbers
Sort
View
SAC
2008
ACM
13 years 8 months ago
Dynamic populations in genetic algorithms
Biological populations are dynamic in both space and time, that is, the population size of a species fluctuates across their habitats over time. There are rarely any static or fix...
Zhanshan (Sam) Ma, Axel W. Krings
FOCS
2009
IEEE
14 years 3 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
CCGRID
2008
IEEE
14 years 3 months ago
Using Dynamic Condor-Based Services for Classifying Schizophrenia in Diffusion Tensor Images
— Diffusion Tensor Imaging (DTI) provides insight into the white matter of the human brain, which is affected by Schizophrenia. By comparing a patient group to a control group, t...
Simon Caton, Matthan Caan, Sílvia Delgado O...
PODC
2005
ACM
14 years 2 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
CCGRID
2003
IEEE
14 years 2 months ago
Creating Services with Hard Guarantees from Cycle-Harvesting Systems
Abstract— Cycle-harvesting software on commodity computers is available from a number of companies and a significant part of the Grid computing landscape. However, creating comm...
Chris Kenyon, Giorgos Cheliotis