1662 search results - page 147 / 333 » The Computational Complexity of Agent Design Problems |
156
click to vote
SIGGRAPH
1995
ACM
15 years 7 months ago
1995
ACM
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals...
128
click to vote
ESSMAC
2003
Springer
15 years 9 months ago
2003
Springer
Kernel-based non-parametric models have been applied widely over recent years. However, the associated computational complexity imposes limitations on the applicability of those me...
127
click to vote
CHI
2009
ACM
15 years 10 months ago
2009
ACM
Prior knowledge is a critical resource for design, especially when designers are striving to generate new ideas for complex problems. Systems that improve access to relevant prior...
127
click to vote
HPCA
2004
IEEE
16 years 4 months ago
2004
IEEE
As microprocessors become increasingly complex, the techniques used to analyze and predict their behavior must become increasingly rigorous. This paper applies wavelet analysis te...
164
click to vote
AAMAS
2011
Springer
14 years 11 months ago
2011
Springer
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...