Sciweavers

1332 search results - page 8 / 267
» Combinatorial Algorithms
Sort
View
DCC
2005
IEEE
14 years 7 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
SODA
2008
ACM
71views Algorithms» more  SODA 2008»
13 years 9 months ago
Two-phase greedy algorithms for some classes of combinatorial linear programs
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
Ulrich Faigle, Britta Peis
ATAL
2008
Springer
13 years 9 months ago
Approximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
Benito Mendoza García, José M. Vidal
IRREGULAR
1995
Springer
13 years 11 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
CEC
2005
IEEE
14 years 1 months ago
A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
José E. Gallardo, Carlos Cotta, Antonio J. ...