Sciweavers

1332 search results - page 114 / 267
» Combinatorial Algorithms
Sort
View
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 6 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
ICC
2007
IEEE
119views Communications» more  ICC 2007»
14 years 3 months ago
A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
Tarcisio F. Maciel, Anja Klein
APPROX
2007
Springer
92views Algorithms» more  APPROX 2007»
14 years 3 months ago
Sublinear Algorithms for Approximating String Compressibility
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
CPM
1997
Springer
87views Combinatorics» more  CPM 1997»
14 years 1 months ago
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
Masamichi Miyazaki, Ayumi Shinohara, Masayuki Take...
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
14 years 27 days ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang