2976 search results - page 521 / 596 » On the bounded integer programming |
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
AAAI
2008
13 years 10 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...