1289 search results - page 215 / 258 » Complexity of Counting the Optimal Solutions |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...
103
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
SCALESPACE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi...
121
click to vote
TCGOV
2005
Springer
15 years 3 months ago
2005
Springer
Growing complexity of the data and processes to be managed, as well as the transition from strict governmental regulation towards autonomy make academic institutions a significant ...
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...