Sciweavers

3244 search results - page 629 / 649
» On convex complexity measures
Sort
View
IJSI
2008
91views more  IJSI 2008»
13 years 9 months ago
Random Event Structures
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Manfred Droste, Guo-Qiang Zhang
JRTIP
2008
118views more  JRTIP 2008»
13 years 9 months ago
Custom parallel caching schemes for hardware-accelerated image compression
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...
Su-Shin Ang, George A. Constantinides, Wayne Luk, ...
MANSCI
2008
96views more  MANSCI 2008»
13 years 9 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...
JSAC
2006
130views more  JSAC 2006»
13 years 9 months ago
Performance Preserving Topological Downscaling of Internet-Like Networks
Abstract--The Internet is a large, heterogeneous system operating at very high speeds and consisting of a large number of users. Researchers use a suite of tools and techniques in ...
Fragkiskos Papadopoulos, Konstantinos Psounis, Ram...
ENTCS
2007
116views more  ENTCS 2007»
13 years 9 months ago
Experiments in Cost Analysis of Java Bytecode
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost rel...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...