1139 search results - page 224 / 228 » Bounded Ideation Theory |
JACM
2000
14 years 10 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
COMCOM
1998
14 years 10 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
108
click to vote
JACM
2002
14 years 10 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
TIP
1998
14 years 10 months ago
1998
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...
TON
1998
14 years 10 months ago
1998
—The notion of effective bandwidths has provided a useful practical framework for connection admission control and capacity planning in high-speed communication networks. The ass...