16404 search results - page 772 / 3281 » A set coverage problem |
178
click to vote
FCT
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
178
click to vote
ISAAC
2005
Springer
16 years 1 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
224
click to vote
WILF
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. This paper is a first step in the direction of extending possibilistic planning to take advantage of the expressive power and reasoning capabilities of fuzzy description...
179
click to vote
EUROPAR
2003
Springer
16 years 21 days ago
2003
Springer
I propose a set of criteria which distinguish a grand challenge in science or engineering from the many other kinds of short-term or long-term research problems that engage the int...
224
click to vote
GECCO
2003
Springer
16 years 21 days ago
2003
Springer
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...