556 search results - page 19 / 112 » A Comparative Study of Some Generalized Rough Approximations |
173
Voted
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
182
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization ...
101
click to vote
TSP
2008
15 years 1 months ago
2008
Abstract--We consider the adaptive detection of a signal of interest embedded in colored noise, when the environment is nonhomogeneous, i.e., when the training samples used for ada...
131
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
CORR
2010
Springer
15 years 10 days ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....