281 search results - page 24 / 57 » Concurrent Java Test Generation as a Search Problem |
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
BMCBI
2008
13 years 7 months ago
2008
imately 20 million abstracts. Browsing such a huge repository to find relevant information as well as providing elearning service requires new generation of interfaces. Methods suc...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
IJCAI
2003
13 years 9 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...