3229 search results - page 429 / 646 » The Theory of Timed Automata |
171
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
154
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
182
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
163
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
161
click to vote
ISLPED
2009
ACM
16 years 1 months ago
2009
ACM
Increasing power densities and the high cost of low thermal resistance packages and cooling solutions make it impractical to design processors for worst-case temperature scenarios...