20126 search results - page 3539 / 4026 » Timed Transition Systems |
170
click to vote
FOSSACS
2003
Springer
16 years 11 days ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
218
click to vote
FPL
2003
Springer
16 years 11 days ago
2003
Springer
Abstract. This paper explores using information about program branch probabilities to optimise reconfigurable designs. The basic premise is to promote utilization by dedicating mo...
185
click to vote
GECCO
2003
Springer
16 years 11 days ago
2003
Springer
The process of labeling each word in a sentence with one of its lexical categories (noun, verb, etc) is called tagging and is a key step in parsing and many other language processi...
160
click to vote
ICCBR
2003
Springer
16 years 11 days ago
2003
Springer
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
171
click to vote
ICOIN
2003
Springer
16 years 11 days ago
2003
Springer
Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O(1) time without considering...