911 search results - page 9 / 183 » First Steps with a Rideable Computer |
NETWORKING
2000
13 years 9 months ago
2000
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
COLING
1990
13 years 9 months ago
1990
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
AMC
2005
13 years 7 months ago
2005
Observer design for highly nonlinear dynamics is an important issue, particularly when the locally observable dynamics are not linearly observable. In such circumstances the abili...
AINA
2009
IEEE
14 years 26 days ago
2009
IEEE
-- Most network intruders launch their attacks through stepping-stones to reduce the risks of being discovered. To uncover such intrusions, one prevalent, challenging, and critical...
ICCAD
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...