1884 search results - page 21 / 377 » Simple Algorithm for Simple Timed Games |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
AIPS
2007
15 years 7 days ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
ASIAN
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present a logic-based framework to evaluate the resilience of computer networks in the face of incidents, i.e., attacks from malicious intruders as well as random faul...