Sciweavers

1182 search results - page 7 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ISNN
2005
Springer
15 years 5 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
VLDB
1991
ACM
122views Database» more  VLDB 1991»
15 years 3 months ago
An Iterative Method for Distributed Database Design
The development of a distributed database systemrequires effective solutions to many complex and interrelated design problems. The cost dependenciesbetween query optimization and ...
Rex Blankinship, Alan R. Hevner, S. Bing Yao
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 3 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
ANOR
2004
155views more  ANOR 2004»
14 years 11 months ago
Model-Based Search for Combinatorial Optimization: A Critical Survey
In this paper we introduce model-based search as a unifying framework accommodating some recently proposed metaheuristics for combinatorial optimization such as ant colony optimiza...
Mark Zlochin, Mauro Birattari, Nicolas Meuleau, Ma...
IAT
2007
IEEE
15 years 6 months ago
A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
Adrian Petcu, Boi Faltings