1355 search results - page 105 / 271 » Alternating Timed Automata over Bounded Time |
COMPGEOM
1992
ACM
15 years 2 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
CORR
2002
Springer
14 years 10 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
114
click to vote
SIES
2009
IEEE
15 years 4 months ago
2009
IEEE
—We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under programmable temporal isolation. A VBS is an extension of a constant-bandwidth server ...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
JAL
2002
14 years 9 months ago
2002
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...