10988 search results - page 128 / 2198 » Algorithmic Folding Complexity |
129
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
109
Voted
EOR
2008
15 years 2 months ago
2008
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
113
Voted
AAECC
2002
Springer
15 years 2 months ago
2002
Springer
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
129
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
159
click to vote
WADS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...