Sciweavers

4940 search results - page 224 / 988
» On the Complexity of Universal Programs
Sort
View
CCGRID
2007
IEEE
15 years 10 months ago
A Hybrid Linear Programming and Evolutionary Algorithm based Approach for On-line Resource Matching in Grid Environments
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
Pawel Garbacki, Vijay K. Naik
JSW
2006
98views more  JSW 2006»
15 years 6 months ago
A Jxta Based Asynchronous Peer-to-Peer Implementation of Genetic Programming
Abstract-- Solving complex real-world problems using evolutionary computation is a CPU time-consuming task that requires a large amount of computational resources. Peerto-Peer (P2P...
Gianluigi Folino, Agostino Forestiero, Giandomenic...
CC
2001
Springer
177views System Software» more  CC 2001»
15 years 11 months ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
EURODAC
1994
IEEE
139views VHDL» more  EURODAC 1994»
15 years 10 months ago
OSCAR: optimum simultaneous scheduling, allocation and resource binding based on integer programming
: This paper presents an approach to high-level synthesis which is based upon a 0/1 integer programming model. In contrast to other approaches, this model allows solving all three ...
Birger Landwehr, Peter Marwedel, Rainer Dömer
ECAI
1998
Springer
15 years 10 months ago
Probabilistic Logic Programming
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
Thomas Lukasiewicz