Sciweavers

3934 search results - page 104 / 787
» Approximate Schedulability Analysis
Sort
View
ICPR
2002
IEEE
16 years 7 months ago
A Fast Leading Eigenvector Approximation for Segmentation and Grouping
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...
CMA
2010
155views more  CMA 2010»
15 years 3 months ago
Approximate solutions to a parameterized sixth order boundary value problem
In this paper, the homotopy analysis method (HAM) is applied to solve a parameterized sixth order boundary value problem which, for large parameter values, cannot be solved by oth...
Songxin Liang, David J. Jeffrey
CMSB
2009
Springer
16 years 27 days ago
Approximation of Event Probabilities in Noisy Cellular Processes
Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time st...
Frédéric Didier, Thomas A. Henzinger...
RTSS
2005
IEEE
15 years 12 months ago
A Deferrable Scheduling Algorithm for Real-Time Transactions Maintaining Data Freshness
Periodic update transaction model has been used to maintain freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus in the past ...
Ming Xiong, Song Han, Kam-yiu Lam
RTCSA
2003
IEEE
15 years 11 months ago
Real-Time Disk Scheduling with On-Disk Cache Conscious
Previous real-time disk scheduling algorithms assume that each disk request incurs a disk mechanical operation and only consider how to move the disk head under real-time constrain...
Hsung-Pin Chang, Ray-I Chang, Wei Kuan Shih, Ruei-...