Sciweavers

3663 search results - page 307 / 733
» Problems in the ontology of computer programs
Sort
View
ICALP
2003
Springer
15 years 12 months ago
Oracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
Ph. Schnoebelen
PPSN
1998
Springer
15 years 11 months ago
Parallel Evolutionary Optimisation with Constraint Propagation
Abstract. This paper describes a parallel model for a distributed memory architecture of a non traditional evolutionary computation method, which integrates constraint propagation ...
Alvaro Ruiz-Andino, Lourdes Araujo, José J....
CEC
2011
IEEE
14 years 6 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
140
Voted
NPC
2007
Springer
16 years 26 days ago
A Cost-Aware Parallel Workload Allocation Approach Based on Machine Learning Techniques
Parallelism is one of the main sources for performance improvement in modern computing environment, but the efficient exploitation of the available parallelism depends on a number ...
Shun Long, Grigori Fursin, Björn Franke
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
15 years 7 months ago
Automatic generation of XSLT stylesheets using evolutionary algorithms
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...
Pablo García-Sánchez, Juan Juli&aacu...