14548 search results - page 446 / 2910 » The Optimal Path-Matching Problem |
210
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
219
click to vote
ISCC
2005
IEEE
16 years 1 months ago
2005
IEEE
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
213
click to vote
PPDP
2005
Springer
16 years 1 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
213
Voted
ALT
2010
Springer
15 years 9 months ago
2010
Springer
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
213
click to vote
DAGM
2010
Springer
15 years 8 months ago
2010
Springer
This paper proposes a new multi-scale energy minimization algorithm which can be used to efficiently solve large scale labelling problems in computer vision. The basic modus operan...