Sciweavers

15375 search results - page 14 / 3075
» cans 2008
Sort
View
ADHOC
2008
59views more  ADHOC 2008»
13 years 7 months ago
Sacrificing a little coverage can substantially increase network lifetime
We present a simple, local protocol, pCover, which provides partial (but high) coverage in sensor networks. Through pCover, we demonstrate that it is feasible to maintain a high c...
Limin Wang, Sandeep S. Kulkarni
ADT
2006
13 years 7 months ago
Data Confidentiality: to which extent cryptography and secured hardware can help
Data confidentiality has become a major concern for individuals as well as for companies and administrations. In a classical client-server setting, the access control management is...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
DCG
2007
91views more  DCG 2007»
13 years 7 months ago
Which n-Venn Diagrams Can Be Drawn with Convex k-Gons?
We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of conve...
Jeremy Carroll, Frank Ruskey, Mark Weston
JANCL
2007
86views more  JANCL 2007»
13 years 7 months ago
Constructive knowledge: what agents can achieve under imperfect information
We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than ...
Wojciech Jamroga, Thomas Ågotnes
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
13 years 8 months ago
Crossover can provably be useful in evolutionary computation
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
Benjamin Doerr, Edda Happ, Christian Klein