Sciweavers

2398 search results - page 151 / 480
» Constraint Programming and Graph Algorithms
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 10 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
INFOCOM
2010
IEEE
15 years 4 months ago
Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Ra...
ESOP
2010
Springer
16 years 3 months ago
Separating Shape Graphs
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
Vincent Laviron, Bor-Yuh Evan Chang and Xavier Riv...
DSN
2000
IEEE
15 years 10 months ago
Fault-Secure Scheduling of Arbitrary Task Graphs to Multiprocessor Systems
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
Koji Hashimoto, Tatsuhiro Tsuchiya, Tohru Kikuno
196
Voted
ICDCIT
2005
Springer
15 years 11 months ago
Analyzing Loop Paths for Execution Time Estimation
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
Abhik Roychoudhury, Tulika Mitra, Hemendra Singh N...