1884 search results - page 18 / 377 » Simple Algorithm for Simple Timed Games |
COMGEO
2000
ACM
14 years 9 months ago
2000
ACM
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
100
click to vote
COMGEO
2008
ACM
14 years 9 months ago
2008
ACM
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
114
click to vote
LICS
1997
IEEE
15 years 2 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
KES
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...