16430 search results - page 379 / 3286 » On Computable Tree Functions |
178
Voted
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
194
click to vote
FCT
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
163
Voted
ICPR
2002
IEEE
16 years 14 days ago
2002
IEEE
Output Coding is a method of converting a multiclass problem into several binary subproblems and gives an ensemble of binary classifiers. Like other ensemble methods, its perform...
153
Voted
ISCAS
2002
IEEE
16 years 13 days ago
2002
IEEE
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all no...
187
click to vote
ACG
2003
Springer
16 years 23 days ago
2003
Springer
Heuristic search effectiveness depends directly upon the quality of heuristic evaluations of states in the search space. We show why ordinal correlation is relevant to heuristic se...