Sciweavers

3049 search results - page 78 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
AHS
2006
IEEE
119views Hardware» more  AHS 2006»
15 years 10 months ago
Particle Swarm Optimization with Discrete Recombination: An Online Optimizer for Evolvable Hardware
Self-reconfigurable adaptive systems have the possibility of adapting their own hardware configuration. This feature provides enhanced performance and flexibility, reflected i...
Jorge Peña, Andres Upegui, Eduardo Sanchez
AI
2011
Springer
14 years 11 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
WISA
2007
Springer
15 years 10 months ago
Iteration Bound Analysis and Throughput Optimum Architecture of SHA-256 (384, 512) for Hardware Implementations
Abstract. The hash algorithm forms the basis of many popular cryptographic protocols and it is therefore important to find throughput optimal implementations. Though there have be...
Yong Ki Lee, Herwin Chan, Ingrid Verbauwhede
CSCLP
2008
Springer
15 years 6 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig
DIS
2004
Springer
15 years 9 months ago
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö,...