Sciweavers

2157 search results - page 329 / 432
» Binary ant algorithm
Sort
View
126
Voted
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 3 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
GECCO
2010
Springer
127views Optimization» more  GECCO 2010»
15 years 3 months ago
Set-based multi-objective optimization, indicators, and deteriorative cycles
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
Rudolf Berghammer, Tobias Friedrich, Frank Neumann
IPPS
2010
IEEE
15 years 2 months ago
Large neighborhood local search optimization on graphics processing units
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...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
QEST
2010
IEEE
15 years 2 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...
ICCV
2009
IEEE
15 years 2 months ago
Efficient multi-label ranking for multi-class learning: Application to object recognition
Multi-label learning is useful in visual object recognition when several objects are present in an image. Conventional approaches implement multi-label learning as a set of binary...
Serhat Selcuk Bucak, Pavan Kumar Mallapragada, Ron...