Sciweavers

2038 search results - page 346 / 408
» Loops under Strategies
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 2 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
ICDCSW
2005
IEEE
14 years 2 months ago
QoS Oriented Dynamic Replica Cost Model for P2P Computing
Replication on multiple nodes is an effective way to improve the availability in the P2P or grid environment. It is difficult to determine how many replicas can fulfill the user r...
Feng Mao, Hai Jin, Deqing Zou, Baoli Chen, Li Qi
VISUALIZATION
2005
IEEE
14 years 2 months ago
Particle and Texture Based Spatiotemporal Visualization of Time-Dependent Vector Fields
We propose a hybrid particle and texture based approach for the visualization of time-dependent vector fields. The underlying spacetime framework builds a dense vector field rep...
Daniel Weiskopf, Frederik Schramm, Gordon Erlebach...
ANCS
2005
ACM
14 years 2 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
COLT
2005
Springer
14 years 2 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon