Sciweavers

2400 search results - page 235 / 480
» Systems Failures
Sort
View
118
Voted
DAGSTUHL
1996
15 years 3 months ago
Competitive Analysis of Distributed Algorithms
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
James Aspnes
CCECE
2006
IEEE
15 years 8 months ago
A Formal CSP Framework for Message-Passing HPC Programming
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
John D. Carter, William B. Gardner
121
Voted
COMCOM
2000
125views more  COMCOM 2000»
15 years 2 months ago
On object initialization in the Java bytecode
Java is an ideal platform for implementing mobile code systems, not only because of its portability but also because it is designed with security in mind. Untrusted Java programs ...
Stephane Doyon, Mourad Debbabi
NAACL
2004
15 years 3 months ago
Optimizing Automated Call Routing by Integrating Spoken Dialog Models with Queuing Models
Organizations are increasingly turning to spoken dialog systems for automated call routing to reduce call center costs. To maintain quality service even in cases of failure, these...
Tim Paek, Eric Horvitz
111
Voted
BCS
2008
15 years 3 months ago
Overcoming Software Fragility with Interacting Feedback Loops and Reversible Phase Transitions
Programs are fragile for many reasons, including software errors, partial failures, and network problems. One way to make software more robust is to design it from the start as a ...
Peter Van Roy