Sciweavers

2796 search results - page 51 / 560
» The coolest path problem
Sort
View
INFOCOM
1999
IEEE
15 years 4 months ago
Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
Dean H. Lorenz, Ariel Orda
RTS
2000
143views more  RTS 2000»
14 years 11 months 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...
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
15 years 6 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
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
15 years 6 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...
MFCS
2004
Springer
15 years 5 months ago
Generating Paths and Cuts in Multi-pole (Di)graphs
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...