Sciweavers

1795 search results - page 359 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
INFOCOM
2011
IEEE
12 years 8 months ago
Adaptive wireless channel probing for shared key generation
—Generating a shared key between two parties from the wireless channel is of increasing interest. The procedure for obtaining information from wireless channel is called channel ...
Yunchuan Wei, Kai Zeng, Prasant Mohapatra
ATAL
2011
Springer
12 years 5 months ago
Learning action models for multi-agent planning
In multi-agent planning environments, action models for each agent must be given as input. However, creating such action models by hand is difficult and time-consuming, because i...
Hankz Hankui Zhuo, Hector Muñoz-Avila, Qian...
SIGCOMM
2012
ACM
11 years 7 months ago
DeTail: reducing the flow completion time tail in datacenter networks
Web applications have now become so sophisticated that rendering a typical page may require hundreds of intra-datacenter flows. At the same time, web sites must meet strict page ...
David Zats, Tathagata Das, Prashanth Mohan, Dhruba...
ISCA
2007
IEEE
110views Hardware» more  ISCA 2007»
13 years 11 months ago
A novel dimensionally-decomposed router for on-chip communication in 3D architectures
Much like multi-storey buildings in densely packed metropolises, three-dimensional (3D) chip structures are envisioned as a viable solution to skyrocketing transistor densities an...
Jongman Kim, Chrysostomos Nicopoulos, Dongkook Par...
PODC
2009
ACM
14 years 5 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan