16430 search results - page 100 / 3286 » On Computable Tree Functions |
106
Voted
ACG
2003
Springer
15 years 8 months ago
2003
Springer
This article presents the results of an empirical experiment designed to gain insight into what is the effect of the minimax algorithm on the evaluation function. The experiment’...
114
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
155
Voted
ICPP
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multic...
129
click to vote
ICN
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Core-based multicast trees use less router state, but have significant drawbacks when compared to shortest-path trees, namely higher delay and poor fault tolerance. We e...
138
Voted
PRL
1998
15 years 3 months ago
1998
We present a computational, group-theoretic approach to steerable functions. The approach is group-theoretic in that the treatment involves continuous transformation groups for wh...