Sciweavers

1169 search results - page 162 / 234
» Degrees of monotone complexity
Sort
View
CSLP
2004
Springer
15 years 6 months ago
Gradience, Constructions and Constraint Systems
Abstract. This paper is concerned with the question of quantifying gradient degrees of acceptability by introducing the notion of Density in the context of constructional constrain...
Philippe Blache, Jean-Philippe Prost
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
15 years 6 months 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...
86
Voted
GECCO
2004
Springer
15 years 6 months ago
Selection-Insertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
Camila S. de Magalhães, Helio J. C. Barbosa...
96
Voted
HIPC
2004
Springer
15 years 6 months ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
109
Voted
ICALP
2004
Springer
15 years 6 months 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