Sciweavers

12825 search results - page 2232 / 2565
» Improved PLSOM algorithm
Sort
View
SIAMCOMP
2000
161views more  SIAMCOMP 2000»
15 years 4 months ago
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
MTA
2007
113views more  MTA 2007»
15 years 4 months ago
Throughput optimization for video streaming proxy servers based on video staging
A video streaming proxy server needs to handle hundreds of simultaneous connections between media servers and clients. Inside, every video arrived at the server and delivered from ...
Wai Kong Cheuk, Daniel Pak-Kong Lun
INFOCOM
2010
IEEE
15 years 3 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
IFIPTCS
2010
15 years 2 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
15 years 9 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
« Prev « First page 2232 / 2565 Last » Next »