1547 search results - page 239 / 310 » Solving Knapsack Problems in a Sticker Based Model |
131
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
113
click to vote
ICDE
2010
IEEE
15 years 3 months ago
2010
IEEE
— We discuss the problem of resource provisioning for database management systems operating on top of an Infrastructure-As-A-Service (IaaS) cloud. To solve this problem, we descr...
266
click to vote
DSP
2007
15 years 3 months ago
2007
Blind separation of sources from nonlinear mixtures is a challenging and often ill-posed problem. We present three methods for solving this problem: an improved nonlinear factor a...
118
click to vote
AI
2000
Springer
15 years 2 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
150
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...