Sciweavers

2252 search results - page 388 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
QEST
2007
IEEE
14 years 3 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
RTSS
2007
IEEE
14 years 3 months ago
Analysis of Hierarchical EDF Pre-emptive Scheduling
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
Fengxiang Zhang, Alan Burns
CPAIOR
2005
Springer
14 years 2 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker
ICNP
1998
IEEE
14 years 1 months ago
Congestion Control Performance of a Reliable Multicast Protocol
This paper evaluates the congestion control performance of Pseudofed, a congestion-controlled, reliable multicast transport protocol for bulk data transfer. Pseudofed's conge...
Dante DeLucia, Katia Obraczka
DBSEC
2006
160views Database» more  DBSEC 2006»
13 years 10 months ago
On Finding an Inference-Proof Complete Database for Controlled Query Evaluation
Abstract. Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know. By modeling t...
Joachim Biskup, Lena Wiese