Sciweavers

866 search results - page 83 / 174
» On Dynamic Shortest Paths Problems
Sort
View
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
14 years 2 months ago
Assigning cameras to subjects in video surveillance systems
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
Hazem El-Alfy, David Jacobs, Larry Davis
ISCC
2006
IEEE
133views Communications» more  ISCC 2006»
14 years 1 months ago
Choosing Weights for IP Network Dimensioning Optimization
Often in Internet Protocol (IP) networks, links are assigned weights, and traffic demands are routed along shortest paths. Hence, these link weights are the parameters which dete...
Olivier Klopfenstein, Sebastien Mamy
ACTA
2010
191views more  ACTA 2010»
13 years 7 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
SIAMNUM
2011
102views more  SIAMNUM 2011»
12 years 10 months ago
Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
Nicola Guglielmi, Christian Lubich