674 search results - page 91 / 135 » The computational complexity of the parallel knock-out probl... |
106
click to vote
ICLP
1997
Springer
15 years 5 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
106
click to vote
DCOSS
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
128
click to vote
CONCUR
2007
Springer
15 years 7 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
102
click to vote
ICCS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. This paper reviews recent developments in our project that are focused on dynamic data-driven methods for efficient and reliable simulation based optimization, which may...