8196 search results - page 262 / 1640 » Computational Modeling and Complexity Science |
161
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
162
click to vote
ACMSE
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we describe our experience in integrating the RIM's BlackBerry handheld wireless device into programming and literacy courses at the University of Guelph and th...
222
click to vote
LOGCOM
2010
15 years 1 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
169
click to vote
SPIN
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We describe a translation from a dialect of SDL-88 to PROMELA, the input language of the SPIN model checker. The fairly straightforward translation covers data types as w...
134
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...