1760 search results - page 22 / 352 » Connected Set Cover Problem and Its Applications |
142
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
158
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
This paper discusses a new model of parallel evolutionary algorithms (EAs) called the specialized island model (SIM) that can be used to generate a set of diverse non-dominated sol...
126
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
157
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
171
Voted
CLIMA
2006
15 years 5 months ago
2006
We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and be...