Sciweavers

592 search results - page 112 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
SIGMOD
2006
ACM
126views Database» more  SIGMOD 2006»
16 years 3 months ago
Declarative networking: language, execution and optimization
The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for...
Boon Thau Loo, Tyson Condie, Minos N. Garofalakis,...
145
Voted
ATAL
2007
Springer
15 years 9 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
138
Voted
ADBIS
2004
Springer
224views Database» more  ADBIS 2004»
15 years 9 months ago
Using Ontologies for Database Query Reformulation
Abstract. Query reformulation techniques based on semantic knowledge have been used in two ways in database management systems, namely for query optimization and for data integrati...
Chokri Ben Necib, Johann Christoph Freytag
131
Voted
BIRTHDAY
2003
Springer
15 years 8 months ago
Extreme Model Checking
One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checkin...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
130
Voted
CC
2008
Springer
133views System Software» more  CC 2008»
15 years 3 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets