Sciweavers

9119 search results - page 187 / 1824
» A Simultaneous Search Problem
Sort
View
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 11 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
ICCV
2007
IEEE
16 years 8 months ago
Global Optimization through Searching Rotation Space and Optimal Estimation of the Essential Matrix
This paper extends the set of problems for which a global solution can be found using modern optimization methods. In particular, the method is applied to estimation of the essent...
Richard I. Hartley, Fredrik Kahl
WECWIS
2009
IEEE
162views ECommerce» more  WECWIS 2009»
16 years 1 months ago
QoS-Driven Web Service Composition Using Learning-Based Depth First Search
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...
Wonhong Nam, Hyunyoung Kil, Jungjae Lee
IWPEC
2009
Springer
16 years 1 months ago
Stable Assignment with Couples: Parameterized Complexity and Local Search
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
Dániel Marx, Ildikó Schlotter
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
15 years 10 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...