11740 search results - page 265 / 2348 » More Problems in Rewriting |
127
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we explore the problem of mapping filtering streaming applications on large-scale homogeneous platforms, with a particular emphasis on communication models and thei...
187
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for forma...
176
Voted
CPM
2010
Springer
15 years 11 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
178
click to vote
CAV
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
172
click to vote
EDOC
2004
IEEE
15 years 10 months ago
2004
IEEE
To focus the comparison of languages for model checking and transformation on criteria that matter in practical development, there is an urgent need for more, and more realistic, ...