16504 search results - page 270 / 3301 » New Problems, New Solutions |
190
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
152
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
158
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
166
click to vote
GECCO
2004
Springer
16 years 21 hour ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
164
click to vote
ISCAS
2006
IEEE
16 years 20 days ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...