Sciweavers

7773 search results - page 1302 / 1555
» On generalized Frame-Stewart numbers
Sort
View
AIPS
2006
15 years 8 months ago
Bounded Branching and Modalities in Non-Deterministic Planning
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
Blai Bonet
CIIT
2004
132views Communications» more  CIIT 2004»
15 years 8 months ago
A vulnerability taxonomy for network protocols: Corresponding engineering best practice countermeasures
Vulnerabilities arising from in-secure network protocol design and implementation present significant challenges to the network protocol community. Yet much of the focus is on sof...
Venkat Pothamsetty, Bora A. Akyol
CIIT
2004
15 years 8 months ago
Considerations on the bit error probability of optical CDMA systems
( )1 The most common metric for evaluating the performance of an optical communications system is the symbol error probability (SEP) versus the received optical power. In circuit-l...
Stefano Galli, Ronald Menendez, Russel Fischer, Ro...
CMS
2006
127views Communications» more  CMS 2006»
15 years 8 months ago
Towards Practical Attacker Classification for Risk Analysis in Anonymous Communication
Abstract. There are a number of attacker models in the area of anonymous communication. Most of them are either very simplified or pretty abstract - therefore difficult to generali...
Andriy Panchenko, Lexi Pimenidis
DAGSTUHL
2004
15 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
« Prev « First page 1302 / 1555 Last » Next »