8540 search results - page 194 / 1708 » The Dynamic Servers Problem |
125
click to vote
JCO
2002
15 years 2 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
161
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
122
click to vote
JOLLI
2010
15 years 1 months ago
2010
embership problem for non-linear Abstract Categorial Grammars Sylvain Salvati Abstract In this paper we show that the membership problem for second order nonbstract Categorial Gram...
164
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
220
click to vote
ICCCI
2011
Springer
14 years 2 months ago
2011
Springer
Multiagent reinforcement learning problems are especially difficult because of their dynamism and the size of joint state space. In this paper a new benchmark problem is proposed, ...