7167 search results - page 220 / 1434 » A Technique for Invariant Generation |
188
click to vote
CAEPIA
2003
Springer
16 years 14 days ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
189
click to vote
COMPGEOM
1996
ACM
15 years 11 months ago
1996
ACM
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
177
click to vote
FPL
2006
Springer
15 years 11 months ago
2006
Springer
Pre-designed IP cores for FPGAs represent a huge intellectual and financial wealth that must be leveraged by any high-level tool targeting reconfigurable platforms. In this paper ...
156
click to vote
ENTCS
2008
15 years 7 months ago
2008
We study distributed state space generation on a cluster of workstations. It is explained why state space partitioning by a global hash function is problematic when states contain...
194
click to vote
ACMSE
2010
ACM
15 years 5 months ago
2010
ACM
Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to gene...