7519 search results - page 387 / 1504 » Optimizing Generic Functions |
182
click to vote
APPROX
2005
Springer
16 years 9 days ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
193
Voted
INFOCOM
2003
IEEE
16 years 1 days ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
194
click to vote
ALMOB
2006
15 years 6 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
181
click to vote
PAMI
2011
15 years 1 months ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
205
click to vote
AAAI
2006
15 years 8 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...