3082 search results - page 177 / 617 » New Bounds for the Controller Problem |
142
Voted
NHM
2010
14 years 11 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
150
click to vote
CCO
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
106
click to vote
ATVA
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform c...
155
click to vote
CADE
2012
Springer
13 years 7 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
155
click to vote
ECOOP
2005
Springer
15 years 10 months ago
2005
Springer
The three problems of the title — the first two widely discussed in the literature, the third less well known but just as important for further development of object technology ...