Sciweavers

1809 search results - page 308 / 362
» On Score Distributions and Relevance
Sort
View
AI
2000
Springer
13 years 8 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
CN
2002
161views more  CN 2002»
13 years 8 months ago
Building multicast services from unicast forwarding and ephemeral state
We present an approach to building multicast services at the network layer using unicast forwarding and two additional building blocks: (i) ephemeral state probes, i.e. extremely l...
Su Wen, Jim Griffioen, Kenneth L. Calvert
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 8 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
JGAA
2000
179views more  JGAA 2000»
13 years 8 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
SIGKDD
2000
96views more  SIGKDD 2000»
13 years 8 months ago
Phenomenal Data Mining: From Data to Phenomena
Phenomenal data mining finds relations between the data and the phenomena that give rise to data rather than just relations among the data. For example, suppose supermarket cash r...
John McCarthy