494 search results - page 84 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
QEST
2008
IEEE
14 years 2 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
TSP
2008
13 years 6 months ago
2008
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
SOFTCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. An artificial neural network with all its elements is a rather complex structure, not easily constructed and/or trained to perform a particular task. Consequently, severa...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...