1662 search results - page 40 / 333 » The Computational Complexity of Agent Design Problems |
IJCAI
1989
13 years 8 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
CAD
2006
Springer
13 years 7 months ago
2006
Springer
This paper describes an approach to interoperability in design projects that is based on computational agents customizing the representation of product data to individual design to...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
CACM
2006
13 years 7 months ago
2006
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...