1054 search results - page 114 / 211 » Capacitated Domination Problem |
105
Voted
ISMB
1994
15 years 4 months ago
1994
Thispaperdescribesthe applicationof the Inductive Logic Programming0LP) program GOLEMto the discoveryof constraintsin the packingof beta-sheets in alpha/betaproteins. Theseconstra...
120
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
109
Voted
NETWORKS
1998
15 years 2 months ago
1998
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
115
Voted
COMPUTING
2010
15 years 5 days ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
132
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...