660 search results - page 51 / 132 » Hybrid CSP Solving |
113
Voted
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
134
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a hybrid approach to detect source-code clones that combines evolutionary algorithms and clustering. A case-study is conducted on a small C++ code base. The pr...
166
Voted
EVOW
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a rece...
123
Voted
ICTAI
1999
IEEE
15 years 8 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
145
Voted
AAI
2005
15 years 3 months ago
2005
The application of AI planning techniques to manufacturing systems is being widely deployed for all the tasks involved in the process, from product design to production planning an...