Sciweavers

1263 search results - page 210 / 253
» A* with Bounded Costs
Sort
View
JCSS
2010
190views more  JCSS 2010»
13 years 6 months ago
Pattern matching with don't cares and few errors
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
Raphaël Clifford, Klim Efremenko, Ely Porat, ...
MOR
2010
118views more  MOR 2010»
13 years 6 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
PKDD
2010
Springer
129views Data Mining» more  PKDD 2010»
13 years 6 months ago
Smarter Sampling in Model-Based Bayesian Reinforcement Learning
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
Pablo Samuel Castro, Doina Precup
SERA
2010
Springer
13 years 6 months ago
Service-Oriented Measurement Infrastructure
The importance of software measurement during the software development process is generally accepted, nowadays. Unfortunately, in practice common software measurement tools find s...
Hashem Yazbek, Reiner R. Dumke, Andreas Schmietend...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 6 months ago
Budget Feasible Mechanisms
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
Christos H. Papadimitriou, Yaron Singer