5165 search results - page 299 / 1033 » Consistency of the Neighbor-Net Algorithm |
195
click to vote
AE
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
168
click to vote
PAAMS
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
159
click to vote
SSS
2009
Springer
15 years 11 months ago
2009
Springer
Consider a fully connected network where up to t processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of e...
170
Voted
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
199
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
We propose in this article an image classification technique based on kernel methods and graphs. Our work explores the possibility of applying marginalized kernels to image process...