Sometimes sensors need to be assembled in response to an emergency. Such assemblage might take a variety of forms. At one extreme, sensors might converge on a single point. At the...
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
— Several heuristic methods have been suggested for improving the generalization capability in neural network learning, most of which are concerned with a single-objective (SO) l...
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Execution of most of the modern DPLL-based SAT solvers is guided by a number of heuristics. Decisions made during the search process are usually driven by some fixed heuristic pol...