4565 search results - page 659 / 913 » Time Optimal Self-Stabilizing Algorithms |
112
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
106
Voted
HEURISTICS
2006
15 years 25 days ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
JMLR
2006
15 years 24 days ago
2006
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
122
Voted
TCS
2008
15 years 22 days ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
92
Voted
TCS
2008
15 years 22 days ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...