Sciweavers

3934 search results - page 494 / 787
» Approximate Schedulability Analysis
Sort
View
TKDE
2012
270views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
PASTE
2004
ACM
16 years 4 days ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
CCGRID
2010
IEEE
15 years 7 months ago
The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets
Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing resources in exchange for payment. In this p...
Sergei Shudler, Lior Amar, Amnon Barak, Ahuva Mu'a...
DAC
2002
ACM
16 years 7 months ago
Scheduler-based DRAM energy management
Previous work on DRAM power-mode management focused on hardware-based techniques and compiler-directed schemes to explicitly transition unused memory modules to low-power operatin...
Victor Delaluz, Anand Sivasubramaniam, Mahmut T. K...
SPAA
2009
ACM
16 years 7 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...