Sciweavers

135 search results - page 17 / 27
» A Distributed Algorithm to Evaluate Quantified Boolean Formu...
Sort
View
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 7 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
ATAL
2007
Springer
14 years 1 months ago
SMILE: Sound Multi-agent Incremental LEarning
This article deals with the problem of collaborative learning in a multi-agent system. Here each agent can update incrementally its beliefs B (the concept representation) so that ...
Gauvain Bourgne, Amal El Fallah-Seghrouchni, Henry...
ATAL
2010
Springer
13 years 8 months ago
Learning context conditions for BDI plan selection
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. In particular, the so-calle...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
BIRTHDAY
2010
Springer
13 years 8 months ago
DKAL and Z3: A Logic Embedding Experiment
Yuri Gurevich and Itay Neeman proposed the Distributed Knowledge Authorization Language, DKAL, as an expressive, yet very succinctly expressible logic for distributed authorization...
Sergio Mera, Nikolaj Bjørner
INFOCOM
2005
IEEE
14 years 1 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...