5595 search results - page 803 / 1119 » Comparing Subsumption Optimizations |
171
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In previous work we presented a multi-robot strategy for routing missions in large scenarios where network connectivity must be explicitly preserved. This strategy is founded o...
332
click to vote
AMMA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we report on the design of a novel market-based approach for decentralised scheduling across multiple factories. Specifically, because of the limitations ...
220
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
190
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
212
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....