4488 search results - page 42 / 898 » Focusing Search by Using Problem Solving Experience |
162
click to vote
NCA
2008
IEEE
15 years 2 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
128
click to vote
ANOR
2011
14 years 9 months ago
2011
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
157
Voted
IPCO
2008
15 years 4 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
134
click to vote
ICMCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We address the problem of recognizing the visual focus of attention (VFOA) of meeting participants from their head pose and contextual cues. The main contribution of the paper is ...
120
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...