2223 search results - page 130 / 445 » Ontological Framework for Approximation |
165
click to vote
TON
2008
15 years 5 months ago
2008
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
113
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
We outline an approach for re-interpreting methods for ranking web pages based on interesting recent work on matrix power series representations for PageRank and its variants, such...
265
click to vote
NLP
2000
15 years 8 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
150
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Reinforcement learning algorithms can become unstable when combined with linear function approximation. Algorithms that minimize the mean-square Bellman error are guaranteed to co...
180
click to vote
WEBDB
2004
Springer
15 years 10 months ago
2004
Springer
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...