Sciweavers

420 search results - page 31 / 84
» Some Algorithmic Problems in Polytope Theory
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 1 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ARITH
2003
IEEE
15 years 3 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger
97
Voted
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
14 years 10 months ago
Rank based variation operators for genetic algorithms
We show how and why using genetic operators that are applied with probabilities that depend on the fitness rank of a genotype or phenotype offers a robust alternative to the Sim...
Jorge Cervantes, Christopher R. Stephens
IPPS
2007
IEEE
15 years 4 months ago
Evolution of Strategy Driven Behavior in Ad Hoc Networks Using a Genetic Algorithm
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
Marcin Seredynski, Pascal Bouvry, Mieczyslaw A. Kl...
AGP
1999
IEEE
15 years 2 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...