Sciweavers

3602 search results - page 691 / 721
» Isn't It About Time
Sort
View
ECCC
2007
122views more  ECCC 2007»
13 years 7 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
MAGS
2008
104views more  MAGS 2008»
13 years 7 months ago
Retractable contract network for empowerment in workforce scheduling
This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It i...
Edward P. K. Tsang, Timothy Gosling, Botond Virgin...
JPDC
2006
133views more  JPDC 2006»
13 years 7 months ago
Locality in structured peer-to-peer networks
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems provide efficient mechanisms for resource placement and location. A key distinguishing fe...
Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Gr...
JUCS
2006
225views more  JUCS 2006»
13 years 7 months ago
Restricting the View and Connecting the Dots - Dangers of a Web Search Engine Monopoly
: Everyone realizes how powerful the few big Web search engine companies have become, both in terms of financial resources due to soaring stock quotes and in terms of the still hid...
Narayanan Kulathuramaiyer, Wolf-Tilo Balke
FMSD
2007
110views more  FMSD 2007»
13 years 7 months ago
Exploiting interleaving semantics in symbolic state-space generation
Symbolic techniques based on Binary Decision Diagrams (BDDs) are widely employed for reasoning about temporal properties of hardware circuits and synchronous controllers. However, ...
Gianfranco Ciardo, Gerald Lüttgen, Andrew S. ...