16404 search results - page 471 / 3281 » A set coverage problem |
164
click to vote
ESA
2003
Springer
16 years 1 days ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
164
click to vote
INFOVIS
2000
IEEE
15 years 11 months ago
2000
IEEE
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
156
click to vote
AUSAI
1998
Springer
15 years 11 months ago
1998
Springer
Decision tree grafting adds nodes to inferred decision trees. Previous research has demonstrated that appropriate grafting techniques can improve predictive accuracy across a wide ...
159
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
185
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...