Sciweavers

823 search results - page 72 / 165
» Stateful Subset Cover
Sort
View
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
14 years 3 months ago
A Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
14 years 3 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
UML
2004
Springer
14 years 3 months ago
SoftContract: Model-Based Design of Error-Checking Code and Property Monitors
This paper discusses a model-based design flow for requirements in distributed embedded software development. Such requirements are specified using a language similar to Linear T...
Luciano Lavagno, Marco Di Natale, Alberto Ferrari,...
INFOCOM
2002
IEEE
14 years 3 months ago
Locality in Search Engine Queries and Its Implications for Caching
—Caching is a popular technique for reducing both server load and user response time in distributed systems. In this paper, we consider the question of whether caching might be e...
Yinglian Xie, David R. O'Hallaron
EUROPAR
1999
Springer
14 years 2 months ago
An Evaluation of High Performance Fortran Compilers Using the HPFBench Benchmark Suite
Abstract. The High Performance Fortran (HPF) benchmark suite HPFBench was designed for evaluating the HPF language and compilers on scalable architectures. The functionality of the...
Guohua Jin, Y. Charlie Hu