Sciweavers

1063 search results - page 36 / 213
» Order and Negation as Failure
Sort
View
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 11 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
EJIS
2010
112views more  EJIS 2010»
13 years 10 months ago
Toward an 'IT Conflict-Resistance Theory': action research during IT pre-implementation
Most empirical research on users' resistance toward Information Technology (IT) has been conducted after implementation of IT in organisations. Little research has been done ...
Regis Meissonier, Emmanuel Houzé
OSDI
2004
ACM
14 years 10 months ago
Microreboot - A Technique for Cheap Recovery
A significant fraction of software failures in large-scale Internet systems are cured by rebooting, even when the exact failure causes are unknown. However, rebooting can be expen...
George Candea, Shinichi Kawamoto, Yuichi Fujiki, G...
USITS
2001
13 years 11 months ago
End-to-End WAN Service Availability
Abstract--This paper seeks to understand how network failures affect the availability of service delivery across wide-area networks (WANs) and to evaluate classes of techniques for...
Bharat Chandra, Michael Dahlin, Lei Gao, Amol Naya...
EPEW
2009
Springer
14 years 4 months ago
Passage-End Analysis
Abstract. Passage-end calculations are a new style of passage measurement for eXtended Stochastic Probes (XSP) [1] which add the ability to split the analysis into several cases de...
Allan Clark, Adam Duguid, Stephen Gilmore