Sciweavers

3082 search results - page 8 / 617
» New Bounds for the Controller Problem
Sort
View
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
15 years 4 months ago
Constant-time admission control for Deadline Monotonic tasks
—The admission control problem is concerned with determining whether a new task may be accepted by a system consisting of a set of running tasks, such that the already admitted a...
Alejandro Masrur, Samarjit Chakraborty, Georg F&au...
PPL
2007
86views more  PPL 2007»
14 years 11 months ago
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
Chryssis Georgiou, Alexander Russell, Alexander A....
TROB
2002
121views more  TROB 2002»
14 years 11 months ago
Adaptive force control of position/velocity controlled robots: theory and experiment
This paper addresses the problem of achieving exact dynamic force control with manipulators possessing the low-level position and/or velocity controllers typically employed in indu...
Jaydeep Roy, Louis L. Whitcomb
NETWORKS
2008
14 years 11 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 8 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...