10304 search results - page 1742 / 2061 » Computer science with the sciences: an emphasis in computati... |
160
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
178
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
161
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
172
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
170
click to vote
ICMT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Model-driven software development often involves several related models. When models are updated, the updates need to be propagated across all models to make them consist...