437 search results - page 40 / 88 » Proving Termination by Divergence |
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
DSN
2007
IEEE
14 years 2 months ago
2007
IEEE
Replicated systems that run over partitionable environments, can exhibit increased availability if isolated partitions are allowed to optimistically continue their execution indep...
WSC
2004
13 years 9 months ago
2004
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
JCS
2002
13 years 7 months ago
2002
We describe the use of a domain-specific language (DSL) for expressing critical design values and constraints in an intrusion detection application. Through the use of this specia...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...