Sciweavers

838 search results - page 17 / 168
» Finding Optimal Solutions to Atomix
Sort
View
ICTAI
2008
IEEE
15 years 8 months ago
Finding Good Starting Points for Solving Structured and Unstructured Nonlinear Constrained Optimization Problems
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...
Soomin Lee, Benjamin W. Wah
136
Voted
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
15 years 5 months ago
Towards estimating nadir objective vector using evolutionary approaches
Nadir point plays an important role in multi-objective optimization because of its importance in estimating the range of objective values corresponding to desired Pareto-optimal s...
Kalyanmoy Deb, Shamik Chaudhuri, Kaisa Miettinen
GECCO
2004
Springer
15 years 7 months ago
Finding Maximum Cliques with Distributed Ants
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
Thang Nguyen Bui, Joseph R. Rizzo
85
Voted
CG
2002
Springer
15 years 1 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao
WEBI
2010
Springer
14 years 11 months ago
Expertise Matching via Constraint-Based Optimization
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
Wenbin Tang, Jie Tang, Chenhao Tan