Sciweavers

1686 search results - page 263 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ICAC
2005
IEEE
15 years 3 months ago
Myrrh: A Transaction-Based Model for Autonomic Recovery
As software comes under increasing scrutiny for its lack of safety and reliability, numerous static and partially dynamic tools (including model checking) have been proposed for v...
Guy Eddon, Steven P. Reiss
WIOPT
2005
IEEE
15 years 3 months ago
Iterated Local Optimization for Minimum Energy Broadcast
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
Intae Kang, Radha Poovendran
ICALP
2004
Springer
15 years 3 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...
ICPP
2003
IEEE
15 years 3 months ago
Scalable Implementations of MPI Atomicity for Concurrent Overlapping I/O
For concurrent I/O operations, atomicity defines the results in the overlapping file regions simultaneously read/written by requesting processes. Atomicity has been well studied...
Wei-keng Liao, Alok N. Choudhary, Kenin Coloma, Ge...
SPAA
2003
ACM
15 years 3 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd