1157 search results - page 187 / 232 » Solving iterated functions using genetic programming |
163
Voted
TJS
2002
15 years 3 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
148
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
116
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
160
Voted
ICML
1999
IEEE
16 years 4 months ago
1999
IEEE
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
140
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...