Sciweavers

186 search results - page 5 / 38
» The x-Wait-Freedom Progress Condition
Sort
View
GECCO
2004
Springer
108views Optimization» more  GECCO 2004»
13 years 11 months ago
The Incremental Pareto-Coevolution Archive
Coevolution can in principle provide progress for problems where no accurate evaluation function is available. An important open question however is how coevolution can be set up s...
Edwin D. de Jong
ACSC
2004
IEEE
13 years 9 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
FASE
2011
Springer
12 years 9 months ago
Theoretical Aspects of Compositional Symbolic Execution
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
Dries Vanoverberghe, Frank Piessens
JUCS
2008
139views more  JUCS 2008»
13 years 5 months ago
A Progressive Learning Method for Symbol Recognition
: This paper deals with a progressive learning method for symbol recognition which improves its own recognition rate when new symbols are recognized in graphic documents. We propos...
Sabine Barrat, Salvatore Tabbone
CLUSTER
2011
IEEE
12 years 5 months ago
Investigating Scenario-Conscious Asynchronous Rendezvous over RDMA
— In this paper, we propose a light-weight asynchronous message progression mechanism for large message transfers in Message Passing Interface (MPI) Rendezvous protocol that is s...
Judicael A. Zounmevo, Ahmad Afsahi