Sciweavers

9405 search results - page 217 / 1881
» Computing a Model of Set Theory
Sort
View
IPPS
2007
IEEE
16 years 26 days ago
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
Robert Hall, Arnold L. Rosenberg, Arun Venkatarama...
SUM
2007
Springer
16 years 20 days ago
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
Mónica Caniupán Marileo, Leopoldo E....
EOR
2007
102views more  EOR 2007»
15 years 6 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
CHI
2010
ACM
16 years 1 months ago
Postcolonial computing: a lens on design and development
As our technologies travel to new cultural contexts and our designs and methods engage new constituencies, both our design and analytical practices face significant challenges. We...
Lilly Irani, Janet Vertesi, Paul Dourish, Kavita P...
CCS
2005
ACM
16 years 2 days ago
On the cost-ineffectiveness of redundancy in commercial P2P computing
We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated...
Matthew Yurkewych, Brian Neil Levine, Arnold L. Ro...