Sciweavers

16404 search results - page 3050 / 3281
» A set coverage problem
Sort
View
WIOPT
2010
IEEE
15 years 3 months ago
On maximizing collaboration in Wireless Mesh Networks without monetary incentives
—In distributed network settings, where nodes are not under the control of a single administrative entity, the fulfillment of fundamental network operations is heavily dependent...
Gabriel Popa, Éric Gourdin, Franck Legendre...
176
Voted
WIOPT
2010
IEEE
15 years 3 months ago
Competitive interference-aware spectrum access in cognitive radio networks
—Cognitive radio networks provide the capability to share the wireless channel with licensed (primary) users in an opportunistic manner. Primary users have a license to operate i...
Jocelyne Elias, Fabio Martignon, Antonio Capone, E...
161
Voted
ASIACRYPT
2010
Springer
15 years 2 months ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara
CEC
2010
IEEE
15 years 2 months ago
Beating the 'world champion' evolutionary algorithm via REVAC tuning
Abstract-- We present a case study demonstrating that using the REVAC parameter tuning method we can greatly improve the `world champion' EA (the winner of the CEC2005 competi...
Selmar K. Smit, A. E. Eiben
COCOA
2010
Springer
15 years 2 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad
« Prev « First page 3050 / 3281 Last » Next »