9842 search results - page 451 / 1969 » The Complexity of the Matching-Cut Problem |
220
click to vote
ESA
2000
Springer
15 years 11 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
183
click to vote
ICGI
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
195
click to vote
AIPS
2007
15 years 9 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
180
click to vote
WSC
2008
15 years 9 months ago
2008
This paper deals with the problem of determining the optimal inspection strategy for a multi-stage production process using simulation optimization. An optimal inspection strategy...
220
click to vote
AMDO
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. In this paper we propose an original approach to solve the Inverse Kinematics problem. Our framework is based on Sequential Monte Carlo Methods and has the advantage to a...