1717 search results - page 133 / 344 » A Computable Spectral Theorem |
143
Voted
SARA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
135
click to vote
ASIAN
2006
Springer
15 years 8 months ago
2006
Springer
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
146
Voted
KDD
2005
ACM
16 years 5 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
121
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Nitrogen is one of the most important chemical intakes to ensure the healthy growth of agricultural crops. However, some environmental concerns emerge (soil and water pollution) w...
164
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...