Sciweavers

1278 search results - page 176 / 256
» Programming Sensor Networks Using Abstract Regions
Sort
View
ICS
1994
Tsinghua U.
15 years 6 months ago
Fault-tolerant wormhole routing in tori
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...
Suresh Chalasani, Rajendra V. Boppana
115
Voted
CN
2000
128views more  CN 2000»
15 years 2 months ago
The Network Workbench: network simulation software for academic investigation of Internet concepts
Simulation offers significant advantages as a basis for academic projects in computer networking. many unimportant details can be abstracted away, and also because simulations can...
J. Mark Pullen
98
Voted
BROADNETS
2005
IEEE
15 years 8 months ago
Network design for IP-centric light trail networks
Abstract— We explore network design principles for nextgeneration all-optical wide-area networks, employing light-trail technology. Light-trail [1] is a light-wave circuit that a...
Srivatsan Balasubramanian, Ahmed E. Kamal, Arun K....
141
Voted
NFM
2011
223views Formal Methods» more  NFM 2011»
14 years 9 months ago
opaal: A Lattice Model Checker
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
Andreas Engelbredt Dalsgaard, René Rydhof H...
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 4 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari