2944 search results - page 251 / 589 » Improving Bound Propagation |
179
click to vote
RTCSA
2007
IEEE
16 years 27 days ago
2007
IEEE
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...
170
click to vote
GD
2004
Springer
16 years 6 hour ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
156
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
169
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
189
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...