1331 search results - page 235 / 267 » Complexity bounds for zero-test algorithms |
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
As real-time systems become more prevalent, there is a need to guarantee that these increasingly complex systems perform as designed. One technique involves a static analysis to p...
VTS
2007
IEEE
14 years 1 months ago
2007
IEEE
—As the complexity of the integrated circuits increases, they become more susceptible to manufacturing faults, decreasing the total process yield. Thus, it would be desirable to ...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
ECAL
2005
Springer
14 years 1 months ago
2005
Springer
We present an example of the dynamical systems approach to learning and adaptation. Our goal is to explore how both control and learning can be embedded into a single dynamical sys...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...