Sciweavers

4940 search results - page 825 / 988
» On the Complexity of Universal Programs
Sort
View
202
Voted
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
16 years 11 days ago
Evolving En-Route Caching Strategies for the Internet
Nowadays, large distributed databases are commonplace. Client applications increasingly rely on accessing objects from multiple remote hosts. The Internet itself is a huge network ...
Jürgen Branke, Pablo Funes, Frederik Thiele
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
16 years 11 days ago
Evaluating Evolutionary Testability with Software-Measurements
Test case design is the most important test activity with respect to test quality. For this reason, a large number of testing methods have been developed to assist the tester with ...
Frank Lammermann, André Baresel, Joachim We...
180
Voted
HIPC
2004
Springer
16 years 11 days ago
A Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
David A. Bader, Kamesh Madduri
ICALP
2004
Springer
16 years 11 days ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...
ICALP
2004
Springer
16 years 11 days ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson