2593 search results - page 34 / 519 » On Two Problems of Nano-PLA Design |
131
click to vote
GECCO
2008
Springer
15 years 5 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...
162
click to vote
AAAI
1994
15 years 5 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...
142
click to vote
DISOPT
2007
15 years 4 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...
147
click to vote
CEC
2005
IEEE
15 years 9 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...
134
click to vote
CHI
2005
ACM
16 years 4 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...