1523 search results - page 196 / 305 » Partially ordered secretaries |
CORR
1998
Springer
15 years 14 days ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
102
click to vote
RV
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to th...
80
Voted
SIAMSC
2010
14 years 11 months ago
2010
This paper constructs extrapolated implicit-explicit time stepping methods that allow one to efficiently solve problems with both stiff and nonstiff components. The proposed meth...
101
Voted
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
102
Voted
ESOP
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. A race condition is a situation where two threads manipulate a data structure simultaneously, without synchronization. Race conditions are common errors in multithreaded ...