13987 search results - page 121 / 2798 » The Two Guards Problem |
108
click to vote
FC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not...
135
click to vote
HEURISTICS
2006
15 years 3 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
122
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem under weighted Hamming distance with bound constraints, wh...
144
click to vote
AAIM
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
109
Voted
SRDS
2008
IEEE
15 years 9 months ago
2008
IEEE
Replicated file-systems can experience degraded performance that might not be adequately handled by the underlying fault-tolerant protocols. We describe the design and implementa...