2542 search results - page 35 / 509 » Computing Cartograms with Optimal Complexity |
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
ACMICEC
2003
ACM
14 years 28 days ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
CEC
2010
IEEE
12 years 11 months ago
2010
IEEE
— This paper presents Evolutionary Optimization Tool (Evoptool), an optimization toolkit that implements a set of meta-heuristics based on the Evolutionary Computation paradigm. ...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
WDAG
2004
Springer
14 years 1 months ago
2004
Springer
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...