Sciweavers

168 search results - page 25 / 34
» On Nontrivial Approximation of CSPs
Sort
View
LICS
2007
IEEE
14 years 4 months ago
Limits of Multi-Discounted Markov Decision Processes
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, dep...
Hugo Gimbert, Wieslaw Zielonka
ICMCS
2005
IEEE
121views Multimedia» more  ICMCS 2005»
14 years 4 months ago
Extracting vocal melody from karaoke music audio
Extracting the melody from polyphonic musical audio is a nontrivial research problem. This paper presents an approach for vocal melody extraction from dual channel Karaoke music a...
Yongwei Zhu, Sheng Gao
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
14 years 3 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
14 years 3 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
14 years 3 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz