Sciweavers

95 search results - page 17 / 19
» On Notions of Completeness Weaker than Kripke Completeness
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 9 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
14 years 9 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano
INDOCRYPT
2004
Springer
14 years 2 months ago
Advances in Alternative Non-adjacent Form Representations
Abstract. From several decades, non-adjacent form (NAF) representations for integers have been extensively studied as an alternative to the usual binary number system where digits ...
Gildas Avoine, Jean Monnerat, Thomas Peyrin
ATAL
2000
Springer
14 years 1 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
14 years 1 months ago
Timing-safe false path removal for combinational modules
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
Yuji Kukimoto, Robert K. Brayton