Sciweavers

3934 search results - page 111 / 787
» Approximate Schedulability Analysis
Sort
View
IPPS
2008
IEEE
16 years 22 days ago
Formal modeling and analysis of real-time resource-sharing protocols in Real-Time Maude
This paper presents general techniques for formally modeling, simulating, and model checking real-time resource-sharing protocols in Real-Time Maude. The “scheduling subset” o...
Peter Csaba Ölveczky, Pavithra Prabhakar, Xue...
ICPADS
2007
IEEE
16 years 19 days ago
Supporting deadline monotonic policy over 802.11 average service time analysis
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario w...
Inès El Korbi, Leïla Azouz Saïdan...
INFOCOM
2010
IEEE
15 years 4 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
CORR
2000
Springer
89views Education» more  CORR 2000»
15 years 6 months ago
Approximation and Exactness in Finite State Optimality Theory
Previous work (Frank and Satta, 1998; Karttunen, 1998) has shown that Optimality Theory with gradient constraints generally is not finite state. A new finite-state treatment of gr...
Dale Gerdemann, Gertjan van Noord
ICASSP
2011
IEEE
14 years 10 months ago
On the effectiveness of the Dark Channel Prior for single image dehazing by approximating with minimum volume ellipsoids
There is an increasing number of methods for removing haze and fog from a single image. One of such methods is Dark Channel Prior (DCP). The goal of this paper is to develop a mat...
Kristofor B. Gibson, Truong Q. Nguyen