10493 search results - page 1543 / 2099 » Dynamic Word Problems |
137
Voted
SPIN
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
128
Voted
DEXA
1995
Springer
15 years 8 months ago
1995
Springer
- In order to accomplish independence on the logical data organization, a relational DBMS must be capable of interpreting query language sentences which reference attributes belong...
139
Voted
ICCAD
1995
IEEE
15 years 8 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
139
click to vote
ICRA
1995
IEEE
15 years 8 months ago
1995
IEEE
An implementation of a biped robot which as capable of dynamic walking by a simple nonlinear control algorithm. is presented. Four D.C. servo motors actuate the knee and ankle joi...
144
click to vote
RTSS
1995
IEEE
15 years 8 months ago
1995
IEEE
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...