5624 search results - page 82 / 1125 » On Conditional Covering Problem |
131
click to vote
CPAIOR
2007
Springer
16 years 11 days ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
150
click to vote
WSC
2008
15 years 8 months ago
2008
We study a stochastic optimization problem that has its roots in financial portfolio design. The problem has a specified deterministic objective function and constraints on the co...
178
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper considers the problem of joint blind source separation (J-BSS), which appears in many practical problems such as blind deconvolution or functional magnetic resonance im...
139
click to vote
UC
2009
Springer
16 years 22 days ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
182
click to vote
ACOM
2006
Springer
16 years 5 days ago
2006
Springer
Abstract. In this paper, we identify some problems with current formalizations of conditional commitments, i.e. commitments to achieve a goal if some condition becomes true. We pre...