Sciweavers

84 search results - page 16 / 17
» A Step Forward in Studying the Compact Genetic Algorithm
Sort
View
PIMRC
2010
IEEE
13 years 4 months ago
Contact surround in opportunistic networks
Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
Nadjet Belblidia, Marcelo Dias de Amorim, Jeremie ...
SOFSEM
2007
Springer
14 years 16 days ago
Deterministic Simulation of a NFA with k -Symbol Lookahead
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
Bala Ravikumar, Nicolae Santean
IJFCS
2007
105views more  IJFCS 2007»
13 years 6 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 18 days ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
BMCBI
2008
124views more  BMCBI 2008»
13 years 6 months ago
Alignment of protein structures in the presence of domain motions
Background: Structural alignment is an important step in protein comparison. Well-established methods exist for solving this problem under the assumption that the structures under...
Roberto Mosca, Barbara Brannetti, Thomas R. Schnei...