8828 search results - page 1280 / 1766 » Formal methods in practice |
180
click to vote
ICLP
1997
Springer
15 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
176
click to vote
ICRA
1993
IEEE
15 years 11 months ago
1993
IEEE
Ordinarily, a robot workspace has insufficientroom to allow the setup of multiple applications simultaneously. As a result, it is common practice to use modular fixtures which hol...
181
click to vote
INFOCOM
1994
IEEE
15 years 11 months ago
1994
IEEE
This pape? presents a novel approach to dynamic transmission bandwidth allocation for transport of real-time variable-bit-rate video in ATM networks. Describe video traffic in the...
195
click to vote
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
191
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...