Sciweavers

4839 search results - page 856 / 968
» A survey of computational complexity results in systems and ...
Sort
View
ICRA
2003
IEEE
222views Robotics» more  ICRA 2003»
15 years 7 months ago
Path planning using learned constraints and preferences
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
Gregory Dudek, Saul Simhon
INFOCOM
2003
IEEE
15 years 7 months ago
Optimizing Route-Cache Lifetime in Ad Hoc Networks
—On-demand routing reduces the control overhead in mobile ad hoc networks, but it has the major drawback of introducing latency between route-request arrival and the determinatio...
Ben Liang, Zygmunt J. Haas
LCN
2003
IEEE
15 years 7 months ago
Analysis of Prioritized Scheduling of Assured Forwarding in DiffServ Architectures
Assured Service has been proposed within the Differentiated Services (DiffServ) model to provide relative service differentiation by attempting to allocate bandwidth to different ...
Nzinga D. Kiameso, Hossam S. Hassanein, Hussein T....
RTSS
2003
IEEE
15 years 7 months ago
Quick-release Fair Scheduling
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
James H. Anderson, Aaron Block, Anand Srinivasan
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
15 years 6 months ago
DAGS: Distribution agnostic sequential Monte Carlo scheme for task execution time estimation
This paper addresses the problem of stochastic task execution time estimation agnostic to the process distributions. The proposed method is orthogonal to the application structure ...
Nabeel Iqbal, M. A. Siddique, Jörg Henkel