2698 search results - page 201 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
206
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
157
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
166
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
179
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
162
click to vote
IJSNET
2008
15 years 6 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...