3136 search results - page 167 / 628 » Genetic programming theory |
148
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
151
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
126
click to vote
FECS
2006
15 years 5 months ago
2006
- In contrast to most of the senior level Artificial Intelligence (AI) courses where AI is taught in the jargon of theoretical computer science with crowd of complex matrix algebra...
139
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
243
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...