895 search results - page 25 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
105
Voted
TCS
2010
14 years 9 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
69
Voted
EOR
2007
14 years 10 months ago
2007
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
80
Voted
AAAI
2007
15 years 25 days ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
112
click to vote
ICTAI
1996
IEEE
15 years 2 months ago
1996
IEEE
The Processor Configuration Problem (PCP) is a Constraint Optimization Problem. The task is to link up a finite set of processors into a network, while minimizing the maximum dist...
110
Voted
HICSS
2008
IEEE
14 years 10 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...