Sciweavers

1080 search results - page 24 / 216
» Problem dependent optimization (PDO)
Sort
View
137
Voted
APWEB
2010
Springer
15 years 7 months ago
An Incremental Prefix Filtering Approach for the All Pairs Similarity Search Problem
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....
Hoang Thanh Lam, Dinh Viet Dung, Raffaele Perego, ...
ISAAC
2009
Springer
168views Algorithms» more  ISAAC 2009»
15 years 10 months ago
On the Camera Placement Problem
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
Rudolf Fleischer, Yihui Wang
ICNC
2009
Springer
15 years 10 months ago
An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
Zhenchao Wang, Haibin Duan, Xiangyin Zhang
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
15 years 10 months ago
Do additional objectives make a problem harder?
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus...
JC
2007
94views more  JC 2007»
15 years 3 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou