Sciweavers

2905 search results - page 94 / 581
» Formal Memetic Algorithms
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
14 years 18 days ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 9 months ago
Mathematical analysis of the recoil growth algorithm to generate multi-polymer systems
The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. While the ...
F. Simatos
ANSS
1991
IEEE
14 years 14 days ago
A provably correct, non-deadlocking parallel event simulation algorithm
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
Meng-Lin Yu, Sumit Ghosh, Erik DeBenedictis
ALGORITHMICA
2010
125views more  ALGORITHMICA 2010»
13 years 9 months ago
On the Fastest Vickrey Algorithm
We investigate the algorithmic performance of Vickrey-Clarke-Groves mechanisms in the single item case. We provide a formal definition of a Vickrey algorithm for this framework, a...
Elena Grigorieva, P. Jean-Jacques Herings, Rudolf ...

Book
321views
15 years 6 months ago
Algorithms
"This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of ...
S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani