134 search results - page 18 / 27 » An Optimal Rebuilding Strategy for an Incremental Tree Probl... |
100
click to vote
PKDD
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
103
click to vote
AI
2002
Springer
14 years 11 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
TPDS
2008
14 years 11 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
ICRA
2007
IEEE
15 years 5 months ago
2007
IEEE
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
GBRPR
2007
Springer
15 years 5 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...