13987 search results - page 172 / 2798 » The Two Guards Problem |
114
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
128
Voted
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
111
Voted
AIPS
2008
15 years 6 months ago
2008
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
103
Voted
ESANN
2008
15 years 5 months ago
2008
Adapting stimuli to stabilize neural responses is an important problem in the context of cortical prostheses. This paper describes two approaches for stimulus adaptation using supp...
110
Voted
DLOG
2004
15 years 5 months ago
2004
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems...