Sciweavers

4488 search results - page 12 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
JPDC
1998
125views more  JPDC 1998»
14 years 10 months ago
Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM
Programlibraries are one tool to make the cooperation between specialists from various elds successful: the separation of application-speci c knowledge from applicationindependent...
Adrian Brüngger, Ambros Marzetta, Jens Clause...
INFORMS
2010
125views more  INFORMS 2010»
14 years 9 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
JSAT
2008
80views more  JSAT 2008»
14 years 11 months ago
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Art...
TEC
2002
163views more  TEC 2002»
14 years 10 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
JCST
2008
134views more  JCST 2008»
14 years 11 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li