Sciweavers

14165 search results - page 512 / 2833
» The generalized two-server problem
Sort
View
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 8 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
WSC
2000
15 years 8 months ago
An analytical model and an optimal scheduling heuristic for collective resource management
In the this paper, we study the problem of collective resource management. We first introduce the problem through realworld examples. Then we generalize the problem and build an a...
Qiang Sun
AAAI
1993
15 years 8 months ago
Learning Semantic Grammars with Constructive Inductive Logic Programming
Automating the construction of semantic grammars is a di cult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be vi...
John M. Zelle, Raymond J. Mooney
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
15 years 8 months ago
Parameter-less evolutionary search
The paper presents the parameter-less implementation of an evolutionary-based search. It does not need any predefined control parameters values, which are usually used for geneti...
Gregor Papa
AI
2007
Springer
15 years 7 months ago
Determining the consistency of partial tree descriptions
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Manuel Bodirsky, Martin Kutz