3270 search results - page 386 / 654 » Approximate String Processing |
95
Voted
AIPS
2007
15 years 3 months ago
2007
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
98
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
138
Voted
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
102
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...