Sciweavers

1302 search results - page 133 / 261
» On the Strong Chromatic Number
Sort
View
ENTCS
2007
129views more  ENTCS 2007»
15 years 6 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
JPDC
2006
187views more  JPDC 2006»
15 years 6 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
EOR
2007
117views more  EOR 2007»
15 years 6 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
TSE
2008
115views more  TSE 2008»
15 years 6 months ago
Do Crosscutting Concerns Cause Defects?
There is a growing consensus that crosscutting concerns harm code quality. An example of a crosscutting concern is a functional requirement whose implementation is distributed acro...
Marc Eaddy, Thomas Zimmermann, Kaitin D. Sherwood,...
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
15 years 6 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...