Sciweavers

1225 search results - page 5 / 245
» Maximal Consistent Subsets
Sort
View
DAM
2008
72views more  DAM 2008»
14 years 11 months ago
On the existence of maximal elements: An impossibility theorem
All sufficient (as well as necessary) conditions for a binary relation on a metric space to admit a maximal element on every nonempty compact subset of its domain that have been f...
Nikolai S. Kukushkin
92
Voted
EVOW
2004
Springer
15 years 5 months ago
A Hierarchical Social Metaheuristic for the Max-Cut Problem
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
Abraham Duarte, Felipe Fernández, Án...
COR
2010
108views more  COR 2010»
14 years 11 months ago
GRASP and path relinking for the max-min diversity problem
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
Mauricio G. C. Resende, Rafael Martí, Micae...
AAAI
2007
15 years 2 months ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
70
Voted
GLOBECOM
2009
IEEE
15 years 6 months ago
Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks
—We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtai...
Elzbieta Beres, Raviraj Adve