2593 search results - page 34 / 519 » On Two Problems of Nano-PLA Design |
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
109
click to vote
AAAI
1994
14 years 11 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
DISOPT
2007
14 years 9 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
In this study, a surrogate model is applied to multi-objective aerodynamic optimization design. For the balanced exploration and exploitation with the surrogate model, objective fu...
CHI
2005
ACM
15 years 10 months ago
2005
ACM
The Cognitive Walkthrough for the Web (CWW) is a partially automated usability evaluation method for identifying and repairing website navigation problems. Building on five earlie...