1326 search results - page 226 / 266 » Approximate Tree Kernels |
133
click to vote
EUROPAR
2005
Springer
15 years 7 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
113
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
111
click to vote
EWSN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
132
click to vote
NIPS
1990
15 years 3 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
124
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...