2905 search results - page 150 / 581 » Formal Memetic Algorithms |
ISCIS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
129
click to vote
HVC
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a dynamic program analysis algorithm that can detect deadlock potentials in a multi-threaded program by examining a single execution trace, obtained by running ...
105
click to vote
IFL
2004
Springer
15 years 6 months ago
2004
Springer
One performance-critical phase in the SML.NET compiler involves rewriting intermediate terms to monadic normal form and performing non-duplicating β-reductions. We present an impe...
RR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
93
Voted
COLT
1993
Springer
15 years 5 months ago
1993
Springer
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...