Sciweavers

10608 search results - page 538 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
176
Voted
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
16 years 1 months ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner
CEC
2005
IEEE
16 years 21 days ago
Hybrid evolutionary static scheduling for heterogeneous systems
Abstract- The complexity of the static scheduling problem on heterogeneous resources has motivated the development of low complexity heuristics such as list scheduling. However, th...
Cristina Boeres, Eyder Rios, Luiz Satoru Ochi
ICNP
2005
IEEE
16 years 20 days ago
A Family of Collusion Resistant Protocols for Instantiating Security
In this paper, we focus on the problem of identifying a family of collusion resistant protocols that demonstrate a tradeoff between the number of secrets that users maintain and t...
Sandeep S. Kulkarni, Bezawada Bruhadeshwar
GECCO
2003
Springer
16 years 8 days ago
Understanding EA Dynamics via Population Fitness Distributions
It is clear from the study of complex non-linear systems in general, and evolutionary algorithms (EAs) in particular, that there is no single analysis tool or technique capable of ...
Elena Popovici, Kenneth A. De Jong
DGCI
2006
Springer
15 years 10 months ago
A New 3D Parallel Thinning Scheme Based on Critical Kernels
Critical kernels constitute a general framework settled in the of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of thi...
Gilles Bertrand, Michel Couprie