69 search results - page 13 / 14 » PWL approximation of dynamical systems: an example |
BMCBI
2005
13 years 7 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
We propose a
ow-control scheme that combines the merits of credit- and rate-based
ow-control schemes by applying direct control over both bandwidth and bu er resources. The goal...
FMCAD
2007
Springer
13 years 11 months ago
2007
Springer
As VLSI fabrication technology progresses to 65nm feature sizes and smaller, transistors no longer operate as ideal switches. This motivates verifying digital circuits using contin...
FLAIRS
2004
13 years 8 months ago
2004
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
FAST
2004
13 years 8 months ago
2004
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...