1662 search results - page 199 / 333 » The Computational Complexity of Agent Design Problems |
COCO
2010
Springer
14 years 25 days ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
MOR
2010
13 years 7 months ago
2010
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Embodied cognition emphasizes that intelligent behavior results from the coupled dynamics between an agent’s body, brain and environment. In response to this, several projects h...
EGH
2009
Springer
13 years 6 months ago
2009
Springer
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
CHI
2007
ACM
14 years 27 days ago
2007
ACM
Software developers must modify their programs to keep up with changing requirements and designs. Often, a conceptually simple change can require numerous edits that are similar b...