Sciweavers

1355 search results - page 97 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 6 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
14 years 28 days ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
WINET
2010
180views more  WINET 2010»
13 years 7 months ago
An analytical model for performance evaluation of multimedia applications over EDCA in an IEEE 802.11e WLAN
—We extend the modeling heuristic of [1] to evaluate the performance of an IEEE 802.11e infrastructure network carrying packet telephone calls, streaming video sessions and TCP c...
Sri Harsha, Anurag Kumar, Vinod Sharma
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 11 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
CADE
2005
Springer
14 years 9 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard