11740 search results - page 38 / 2348 » More Problems in Rewriting |
WRLA
2010
13 years 7 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
CMSB
2011
Springer
12 years 8 months ago
2011
Springer
From the phosphorylation state of a molecule to the volume of a cell, parameters are ubiquitous in systems biology. At the same time, most models involve static or dynamic compart...
FLOPS
2008
Springer
13 years 10 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
DISOPT
2008
13 years 8 months ago
2008
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, whe...