Sciweavers

725 search results - page 43 / 145
» heuristics 2010
Sort
View
ASIACRYPT
2010
Springer
13 years 8 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth
EOR
2006
128views more  EOR 2006»
13 years 10 months ago
Scatter search for project scheduling with resource availability cost
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
Denise Sato Yamashita, Vinícius Amaral Arme...
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
14 years 1 months ago
Niching the CMA-ES via nearest-better clustering
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
Mike Preuss
EOR
2007
90views more  EOR 2007»
13 years 10 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
13 years 11 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri