Sciweavers

67 search results - page 12 / 14
» Optimal Paths in Weighted Timed Automata
Sort
View
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
13 years 5 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
INFOCOM
2005
IEEE
13 years 11 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
ICCV
2007
IEEE
14 years 7 months ago
Applications of parametric maxflow in computer vision
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
Vladimir Kolmogorov, Yuri Boykov, Carsten Rother
EMSOFT
2006
Springer
13 years 9 months ago
An analysis framework for network-code programs
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...
Madhukar Anand, Sebastian Fischmeister, Insup Lee
CGO
2008
IEEE
13 years 7 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan