Sciweavers

55 search results - page 7 / 11
» A Columnar Competitive Model with Simulated Annealing for So...
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 6 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
13 years 11 months ago
Hybrid search for cardinality constrained portfolio optimization
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
Miguel A. Gomez, Carmen X. Flores, Maria A. Osorio
SSPR
1998
Springer
13 years 12 months ago
A Statistical Clustering Model and Algorithm
In this paper, a statistical clustering model and algorithm have been discussed. Finding the optimal solution to clustering problem is transformed into simulating the equilibrium ...
Guangwen Yang, Weimin Zheng, Dingxing Wang
ATAL
2003
Springer
14 years 29 days ago
Multiagent diffusion and distributed optimization
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
Kwok Ching Tsui, Jiming Liu
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...