Sciweavers

2485 search results - page 410 / 497
» Time Bounded Frequency Computations
Sort
View
STACS
2005
Springer
14 years 1 months ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 1 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
FSTTCS
2004
Springer
14 years 1 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
DSN
2002
IEEE
14 years 25 days ago
Process Modelling to Support Dependability Arguments
This paper reports work to support dependability arguments about the future reliability of a product before there is direct empirical evidence. We develop a method for estimating ...
Robin E. Bloomfield, Sofia Guerra
DSN
2002
IEEE
14 years 25 days ago
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
Paolo Santi, Douglas M. Blough