1279 search results - page 29 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
136
click to vote
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
107
click to vote
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
AUSAI
2004
Springer
15 years 7 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
103
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
111
Voted
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...