Sciweavers

11328 search results - page 219 / 2266
» Timed Branching Processes
Sort
View
TALG
2010
74views more  TALG 2010»
15 years 2 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan
ISSTA
2012
ACM
13 years 6 months ago
Isolating failure causes through test case generation
Manual debugging is driven by experiments—test runs that narrow down failure causes by systematically confirming or excluding individual factors. The BUGEX approach leverages t...
Jeremias Röbetaler, Gordon Fraser, Andreas Ze...
IEAAIE
2007
Springer
15 years 10 months ago
Intelligent OS Process Scheduling Using Fuzzy Inference with User Models
The process scheduling aims to arrange CPU time to multiple processes for providing users with more efficient throughput. Except the class of process set by user, conventional oper...
Sungsoo Lim, Sung-Bae Cho
ICWS
2004
IEEE
15 years 5 months ago
An Adaptive Process Allocation Strategy for Proportional Responsiveness Differentiation on Web Servers
There is a growing demand for provisioning of different levels of quality of service (QoS) on Web servers to meet changing resource availability and satisfy different client requi...
Xiaobo Zhou, Yu Cai, Ganesh Godavari, C. Edward Ch...
ICIP
1999
IEEE
16 years 5 months ago
Power Optimized Space-Time Code for Layer Coded Multimedia over Wireless Channels
A power optimized space-time code is presented for reliable delivery of layer coded multimedia data through wireless channels. Appropriate power control further improves the perfo...
Haitao Zheng, K. J. Ray Liu