5624 search results - page 372 / 1125 » On Conditional Covering Problem |
207
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
189
click to vote
UAI
1996
15 years 8 months ago
1996
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
163
Voted
ENTCS
2008
15 years 6 months ago
2008
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
180
click to vote
MOR
2008
15 years 6 months ago
2008
Abstract. We propose a new solution method for optimal stopping problems with random discounting for linear diffusions whose state space has a combination of natural, absorbing, or...
192
click to vote
JAL
2002
15 years 6 months ago
2002
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...