4865 search results - page 591 / 973 » The Complexity of Graph Connectivity |
196
click to vote
AIPS
2007
15 years 10 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 ...
205
click to vote
FLAIRS
2008
15 years 10 months ago
2008
We develop a formal system dealing `spatially' with certain aspects of uniformity and control during knowledge acquisition. To this end, we study an appropriate modality, whi...
152
click to vote
ESANN
2004
15 years 9 months ago
2004
We derive analytical expressions of local codim-1-bifurcations for a fully connected, additive, discrete-time RNN, where we regard the external inputs as bifurcation parameters. Th...
189
click to vote
WSC
1998
15 years 9 months ago
1998
This paper describes a simulation model of a large beverage distribution center. The brewery distribution center has a volume of 71,600 cubic meters and contains about 8,000 palle...
163
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...