Sciweavers

620 search results - page 82 / 124
» Towards Optimal Bayesian Algorithmic Mechanism Design
Sort
View
FLAIRS
2004
14 years 11 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
15 years 4 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
CAD
2006
Springer
14 years 10 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
15 years 4 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
TC
2008
14 years 10 months ago
Counter-Based Cache Replacement and Bypassing Algorithms
Recent studies have shown that, in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
Mazen Kharbutli, Yan Solihin