531 search results - page 67 / 107 » A Better Algorithm for Random k-SAT |
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
The hidden Markov field (HMF) model has been used in many model-based solutions to image analysis problems, including that of image segmentation, and generally gives satisfying re...
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
ISICA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
EGC
2005
Springer
14 years 1 months ago
2005
Springer
The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates the management...
PPSN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...