16430 search results - page 140 / 3286 » On Computable Tree Functions |
156
click to vote
AI
2000
Springer
15 years 6 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
179
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
151
click to vote
DLT
2004
15 years 7 months ago
2004
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
151
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Because of the increasing dominance of interconnect issues in advanced IC technology, placement has become a critical step in the IC design flow. To get accurate interconnect inf...
162
click to vote
ICALP
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...