Sciweavers

482 search results - page 44 / 97
» Exploration in Metric State Spaces
Sort
View
IJCAI
2007
13 years 9 months ago
Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis
Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysi...
Evgeniy Gabrilovich, Shaul Markovitch
CN
2010
103views more  CN 2010»
13 years 8 months ago
Resilient and survivable networks
This poster discusses methods to characterize the resilience of networks to a number of challenges and attacks, with the goal of developing quantifiable metrics to determine the de...
Bernhard Plattner, David Hutchison, James P. G. St...
APPROX
2009
Springer
96views Algorithms» more  APPROX 2009»
14 years 2 months ago
On the Optimality of Gluing over Scales
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...
Alexander Jaffe, James R. Lee, Mohammad Moharrami
ICML
2007
IEEE
14 years 8 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
SARA
2009
Springer
14 years 2 months ago
Integrating Constraint Models for Sequential and Partial-Order Planning
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
Roman Barták, Daniel Toropila