Sciweavers

1557 search results - page 40 / 312
» Programming up to Congruence
Sort
View
COR
2006
98views more  COR 2006»
14 years 11 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
TACAS
2009
Springer
135views Algorithms» more  TACAS 2009»
15 years 5 months ago
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer
ECOOP
2004
Springer
15 years 2 months ago
Programming with Crosscutting Effective Views
Abstract. Aspect-oriented systems claim to improve modularity by providing explicit mechanisms that allow modularization of concerns which crosscut the object-oriented decompositio...
Doug Janzen, Kris De Volder
ISCI
1998
193views more  ISCI 1998»
14 years 10 months ago
A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
David Andre, John R. Koza
EUROGP
2004
Springer
129views Optimization» more  EUROGP 2004»
15 years 4 months ago
Evolution and Acquisition of Modules in Cartesian Genetic Programming
The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of...
James Alfred Walker, Julian Francis Miller