949 search results - page 49 / 190 » Lightweight Formal Methods for Computer Algebra Systems |
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
FM
2008
Springer
13 years 9 months ago
2008
Springer
TLM (Transaction-Level Modeling) was introduced to cope with the increasing complexity of Systems-on-Chip designs by raising the modeling level. Currently, TLM is primarily used fo...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
IJIT
2004
13 years 9 months ago
2004
As computer network technology becomes increasingly complex, it becomes necessary to place greater requirements on the validity of developing standards and the resulting technology...
ENTCS
2007
13 years 7 months ago
2007
Arigatoni is a lightweight overlay network that deploys the Global Computing Paradigm over the Internet. Communication for over the behavioral units of the overlay is performed by...