3020 search results - page 109 / 604 » Optimal partition trees |
139
click to vote
CLASSIFICATION
2008
15 years 6 months ago
2008
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
167
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
181
click to vote
PROCEDIA
2010
15 years 29 days ago
2010
The field of bioinformatics is witnessing a rapid and overwhelming accumulation of molecular sequence data, predominantly driven by novel wet-lab sequencing techniques. This trend...
152
click to vote
FUIN
2010
15 years 3 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
164
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...