Sciweavers

8431 search results - page 1634 / 1687
» Algorithmically Independent Sequences
Sort
View
CORR
2000
Springer
120views Education» more  CORR 2000»
13 years 9 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
MST
2000
57views more  MST 2000»
13 years 9 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
APIN
1998
107views more  APIN 1998»
13 years 9 months ago
Multiple Adaptive Agents for Tactical Driving
Abstract. Recent research in automated highway systems has ranged from low-level vision-based controllers to high-level route-guidance software. However, there is currently no syst...
Rahul Sukthankar, Shumeet Baluja, John Hancock
AMAI
1999
Springer
13 years 9 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
JCT
1998
193views more  JCT 1998»
13 years 9 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
« Prev « First page 1634 / 1687 Last » Next »