3415 search results - page 375 / 683 » Lower bounds on kernelization |
169
click to vote
AAAI
1992
15 years 7 months ago
1992
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
142
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
174
Voted
DAM
2010
15 years 6 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
194
click to vote
DC
2010
15 years 6 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
140
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...