4131 search results - page 164 / 827 » The Generalized Max-Controlled Set Problem |
143
Voted
JCO
2008
15 years 3 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
123
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
135
Voted
RSCTC
2000
Springer
15 years 7 months ago
2000
Springer
Induction of decision rules within the dominance-based rough set approach to the multiple-criteria sorting decision problem is discussed in this paper. We introduce an algorithm ca...
149
click to vote
COMGEO
2006
ACM
15 years 3 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
129
Voted
NETWORKS
2010
15 years 1 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...