5326 search results - page 203 / 1066 » On what we can ensure |
151
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with as...
156
click to vote
CCCG
2007
15 years 8 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
151
click to vote
ACL
2001
15 years 8 months ago
2001
This paper investigates how, and to what extent the flexibility and robustness of a partial parser can be utilized to automatically extend existing semantic lexicons. Our work is ...
153
click to vote
IWEC
2004
15 years 7 months ago
2004
With the increase of computer capabilities, many learning systems have become complex simulators with advanced interfaces close to game quality. However, many games features have n...
157
click to vote
ENTCS
2006
15 years 6 months ago
2006
A generalization of the Reversed Compound Agent Theorem of Markovian process algebra is derived that yields separable, but non-product-form solutions for collections of interactin...