Sciweavers

3678 search results - page 139 / 736
» On the Stable Paths Problem
Sort
View
101
Voted
RTS
2000
143views more  RTS 2000»
15 years 25 days ago
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
Henrik Theiling, Christian Ferdinand, Reinhard Wil...
100
Voted
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
15 years 7 months ago
Path following for an omnidirectional mobile robot based on model predictive control
— In this paper, the path following problem of an omnidirectional mobile robot has been studied. Given the error dynamic model derived from the robot state vector and the path st...
Kiattisin Kanjanawanishkul, Andreas Zell
LCN
1997
IEEE
15 years 5 months ago
The Optimal Virtual Path Design of ATM Networks
This paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the mrximumjow density of links is proposed for the optimal virtual pa...
Zhigang Qin, Tetiana Lo, Felix F. Wu
137
Voted
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 4 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
15 years 7 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...