Sciweavers

198 search results - page 27 / 40
» On Extremal Cases of Hopcroft's Algorithm
Sort
View
IJCAI
2003
13 years 9 months ago
Definition and Complexity of Some Basic Metareasoning Problems
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to t...
Vincent Conitzer, Tuomas Sandholm
EMNLP
2010
13 years 6 months ago
Training Continuous Space Language Models: Some Practical Issues
Using multi-layer neural networks to estimate the probabilities of word sequences is a promising research area in statistical language modeling, with applications in speech recogn...
Hai Son Le, Alexandre Allauzen, Guillaume Wisniews...
RTAS
2010
IEEE
13 years 6 months ago
Improved Task Management Techniques for Enforcing EDF Scheduling on Recurring Tasks
The management of tasks is an essential requirement in most real-time and embedded systems, but invariably leads to unwanted CPU overheads. This paper is concerned with task manage...
Michael Short
TC
2010
13 years 3 months ago
Scheduling Concurrent Bag-of-Tasks Applications on Heterogeneous Platforms
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
Anne Benoit, Loris Marchal, Jean-Francois Pineau, ...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 9 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira