14548 search results - page 120 / 2910 » The Optimal Path-Matching Problem |
145
click to vote
ISAAC
1993
Springer
15 years 6 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
AAAI
2006
15 years 3 months ago
2006
We present an asymptotically optimal algorithm for the max variant of the k-armed bandit problem. Given a set of k slot machines, each yielding payoff from a fixed (but unknown) d...
107
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
AICT
2006
IEEE
15 years 8 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
130
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...