Sciweavers

5580 search results - page 26 / 1116
» Randomized priority algorithms
Sort
View
RTCSA
2005
IEEE
14 years 2 months ago
Model Checking Timed Systems with Priorities
Priorities are used to resolve conflicts such as in resource sharing and in safety designs. The use of priorities has become indispensable in real-time system design such as in s...
Pao-Ann Hsiung, Shang-Wei Lin
INFOCOM
2000
IEEE
14 years 1 months ago
Fast and Scalable Priority Queue Architecture for High-Speed Network Switches
-In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) gu...
Ranjita Bhagwan, Bill Lin
AIPS
2007
13 years 11 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
RSA
2006
144views more  RSA 2006»
13 years 9 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
ICDE
2004
IEEE
108views Database» more  ICDE 2004»
14 years 10 months ago
Priority Mechanisms for OLTP and Transactional Web Applications
Transactional workloads are a hallmark of modern OLTP and Web applications, ranging from electronic commerce and banking to online shopping. Often, the database at the core of the...
David T. McWherter, Bianca Schroeder, Anastassia A...