Sciweavers

2473 search results - page 48 / 495
» The Logic of Communication Graphs
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
SIROCCO
2010
13 years 9 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...
3DIC
2009
IEEE
258views Hardware» more  3DIC 2009»
14 years 2 months ago
A capacitive coupling interface with high sensitivity for wireless wafer testing
—A high-sensitivity capacitive-coupling interface is presented for wireless wafer testing systems. The transmitter is a buffer that drives the transmitter pad, and the receiver c...
Gil-Su Kim, Makoto Takamiya, Takayasu Sakurai
ASP
2005
Springer
14 years 1 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
ESOP
2000
Springer
13 years 11 months ago
Sharing Continuations: Proofnets for Languages with Explicit Control
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
Julia L. Lawall, Harry G. Mairson