199 search results - page 24 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
TJS
2008
14 years 11 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
78
Voted
ENTCS
2000
14 years 11 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
104
click to vote
JAIR
2000
14 years 11 months ago
2000
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
STOC
1989
ACM
15 years 3 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
112
click to vote
CASC
2006
Springer
15 years 3 months ago
2006
Springer
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...