Sciweavers

420 search results - page 7 / 84
» Some Algorithmic Problems in Polytope Theory
Sort
View
GECCO
2006
Springer
189views Optimization» more  GECCO 2006»
13 years 11 months ago
Game theory as a new paradigm for phenotype characterization of genetic algorithms
In this paper, it is presented a new way to characterize the phenotype in the context of Genetic Algorithms through the use of Game Theory as a theoretical foundation to define a ...
Otávio Noura Teixeira, Artur Noura Teixeira...
FSTTCS
2004
Springer
14 years 25 days ago
Join Algorithms for the Theory of Uninterpreted Functions
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
Sumit Gulwani, Ashish Tiwari, George C. Necula
EWSN
2004
Springer
14 years 25 days ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
SPAA
2010
ACM
14 years 8 days ago
Parallel approximation algorithms for facility-location problems
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
Guy E. Blelloch, Kanat Tangwongsan
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
14 years 2 months ago
Cheating for problem solving: a genetic algorithm with social interactions
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
Rafael Lahoz-Beltra, Gabriela Ochoa, Uwe Aickelin