Sciweavers

1998 search results - page 327 / 400
» Complexity of the Cover Polynomial
Sort
View
83
Voted
ICRA
2003
IEEE
118views Robotics» more  ICRA 2003»
15 years 5 months ago
Capturing a convex object with three discs
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
Jeff Erickson, Shripad Thite, Fred Rothganger, Jea...
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
15 years 5 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 5 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 5 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 5 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