9842 search results - page 29 / 1969 » Problem complexity |
NETWORKS
2010
13 years 6 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
IJCAI
1989
13 years 8 months ago
1989
Existing explanation facilities are typically far more appropriate for knowledge engineers engaged in system maintenance than for endusers of the system. This is because the expla...
JACM
2002
13 years 7 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
COLT
2003
Springer
14 years 26 days ago
2003
Springer
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...