4520 search results - page 264 / 904 » Algebraic Techniques for Timed Systems |
193
click to vote
TPHOL
2003
IEEE
16 years 16 days ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
267
click to vote
FOCS
2002
IEEE
16 years 7 days ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
192
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
179
click to vote
CPM
2006
Springer
15 years 11 months ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
202
click to vote
WSC
2007
15 years 9 months ago
2007
Developing and analyzing schedules is essential for successfully controlling the time aspect of construction projects. The critical path method of scheduling is by far the most wi...