Sciweavers

7758 search results - page 1466 / 1552
» On the Number of Distributive Lattices
Sort
View
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 11 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
APSEC
2002
IEEE
15 years 11 months ago
A Virtual File System for Source Program Editing
In this paper, we propose a virtual file system, “SPDFS,” which provides global declarations in source programs as virtual files to programmers. Global declarations means ob...
Yoshida Atsushi, Fukuyasu Naoki
DSN
2002
IEEE
15 years 11 months ago
Model Checking Performability Properties
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
Boudewijn R. Haverkort, Lucia Cloth, Holger Herman...
ICDCSW
2002
IEEE
15 years 11 months ago
Class-Based Delta-Encoding: A Scalable Scheme for Caching Dynamic Web Content
Abstract—Caching static HTTP traffic in proxy-caches has reduced bandwidth consumption and download latency. However, web-caching performance is hard to increase further due to ...
Konstantinos Psounis
ICPP
2002
IEEE
15 years 11 months ago
Pattern-Based Parallel Programming
The advantages of pattern-based programming have been well-documented in the sequential literature. However patterns have yet to make their way into mainstream parallel computing,...
Steven Bromling, Steve MacDonald, John Anvik, Jona...
« Prev « First page 1466 / 1552 Last » Next »