Sciweavers

914 search results - page 138 / 183
» Branch and Bound on the Network Model
Sort
View
WIOPT
2005
IEEE
15 years 3 months ago
A New Relaying Scheme for Cheap Wireless Relay Nodes
Wireless networks consist of senders, receivers, and intermediate nodes that collaborating (more or less) to establish the communication paths. Most of the researches in the domai...
Ramin Khalili, Kavé Salamatian
INFOCOM
2007
IEEE
15 years 4 months ago
On Optimal MAC Scheduling With Physical Interference
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
ICLP
2010
Springer
15 years 1 months ago
Efficient Solving of Time-dependent Answer Set Programs
Answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time po...
Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chri...
ASIACRYPT
2008
Springer
14 years 12 months ago
Chosen Ciphertext Security with Optimal Ciphertext Overhead
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). ...
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto
BDA
2003
14 years 11 months ago
Memory Requirements for Query Execution in Highly Constrained Devices
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral