Sciweavers

4565 search results - page 502 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
15 years 9 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
GECCO
2005
Springer
15 years 9 months ago
Towards an analysis of dynamic environments
Although the interest in nature-inspired optimization of dynamic problems has been growing constantly over the past decade, very little has been done to analyze and characterize a...
Jürgen Branke, Erdem Salihoglu, Sima Uyar
GECCO
2003
Springer
115views Optimization» more  GECCO 2003»
15 years 9 months ago
The General Yard Allocation Problem
The General Yard Allocation Problem (GYAP) is a resource allocation problem faced by the Port of Singapore Authority. Here, space allocation for cargo is minimized for all incoming...
Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues
GECCO
2006
Springer
178views Optimization» more  GECCO 2006»
15 years 7 months ago
A dynamic approach to artificial immune systems utilizing neural networks
The purpose of this work is to propose an immune-inspired setup to use a self-organizing map as a computational model for the interaction of antigens and antibodies. The proposed ...
Stefan Schadwinkel, Werner Dilger
APPROX
2009
Springer
115views Algorithms» more  APPROX 2009»
15 years 10 months ago
Small Clique Detection and Approximate Nash Equilibria
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
Lorenz Minder, Dan Vilenchik