Sciweavers

814 search results - page 59 / 163
» Optimal pairings
Sort
View
JEA
2006
83views more  JEA 2006»
13 years 10 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
GECCO
2005
Springer
120views Optimization» more  GECCO 2005»
14 years 3 months ago
Distributed genetic algorithm for subtraction radiography
Digital subtraction is a promising technique used in radiographic studies of periapical lesions and other dental disorders for which the treatment must be evaluated over time. Thi...
Gabriel Mañana, Fabio A. González, E...
AUTOMATICA
2005
136views more  AUTOMATICA 2005»
13 years 9 months ago
Conjugate Lyapunov functions for saturated linear systems
Based on a recent duality theory for linear differential inclusions (LDIs), the condition for stability of an LDI in terms of one Lyapunov function can be easily derived from that...
Tingshu Hu, Rafal Goebel, Andrew R. Teel, Zongli L...
COLT
2005
Springer
14 years 3 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
14 years 1 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack