Sciweavers

2957 search results - page 377 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
IPPS
2006
IEEE
16 years 16 days ago
Schedulability analysis of non-preemptive recurring real-time tasks
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
Sanjoy K. Baruah, Samarjit Chakraborty
SSDBM
2006
IEEE
139views Database» more  SSDBM 2006»
16 years 16 days ago
Sampling Trajectory Streams with Spatiotemporal Criteria
Monitoring movement of high-dimensional points is essential for environmental databases, geospatial applications, and biodiversity informatics as it reveals crucial information ab...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
DOLAP
2006
ACM
16 years 15 days ago
Pre-aggregation with probability distributions
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...
Igor Timko, Curtis E. Dyreson, Torben Bach Pederse...
ISCAS
2005
IEEE
133views Hardware» more  ISCAS 2005»
16 years 3 days ago
Multiobjective VLSI cell placement using distributed simulated evolution algorithm
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
Sadiq M. Sait, Ali Mustafa Zaidi, Mustafa I. Ali
RTSS
2005
IEEE
16 years 3 days ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo