1816 search results - page 124 / 364 » A New Approach for Solving the Maximum Clique Problem |
190
click to vote
CAIP
2007
Springer
15 years 10 months ago
2007
Springer
Fracture of the bone is a very serious medical condition. In clinical practice, a tired radiologist has been found to miss fracture cases after looking through many images containi...
143
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
151
click to vote
IDA
2008
Springer
15 years 6 months ago
2008
Springer
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
162
click to vote
ISCAS
2006
IEEE
16 years 8 days ago
2006
IEEE
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
151
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract — In [13], a new algorithm was proposed for efficiently solving the simultaneous localization and mapping (SLAM) problem. In this paper, we extend this algorithm to han...