Sciweavers

14548 search results - page 120 / 2910
» The Optimal Path-Matching Problem
Sort
View
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 2 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
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...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
AAAI
2006
13 years 11 months ago
An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
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...
Matthew J. Streeter, Stephen F. Smith
PODS
2010
ACM
215views Database» more  PODS 2010»
14 years 3 months ago
An optimal algorithm for the distinct elements problem
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...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
AICT
2006
IEEE
14 years 4 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— 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...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 11 months ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
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...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi