Sciweavers

1379 search results - page 224 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
15 years 3 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
WORDS
2003
IEEE
15 years 3 months ago
Scalable Online Feasibility Tests for Admission Control in a Java Real-Time System
In the Komodo project a real-time Java system based on a multithreaded Java microcontroller has been developed. A main scheduling policy realized by hardware in the microcontroller...
Uwe Brinkschulte
CASES
2003
ACM
15 years 3 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
ATAL
2003
Springer
15 years 3 months ago
Constructing optimal policies for agents with constrained architectures
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
Dmitri A. Dolgov, Edmund H. Durfee
ECML
2003
Springer
15 years 3 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...