2899 search results - page 68 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
CORR
2008
Springer
15 years 1 months ago
2008
Springer
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
ISAAC
2001
Springer
15 years 5 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
111
click to vote
FAW
2009
Springer
15 years 6 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
107
click to vote
PVM
2005
Springer
15 years 7 months ago
2005
Springer
We present an algorithm for implementing byte-range locks using MPI passive-target one-sided communication. This algorithm is useful in any scenario in which multiple processes of ...