1698 search results - page 121 / 340 » Growing Complex Games |
112
click to vote
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
137
click to vote
DAC
1997
ACM
15 years 8 months ago
1997
ACM
Novel test bench techniques are required to cope with a functional test complexity which is predicted to grow much more strongly than design complexity. Our test bench approach at...
125
click to vote
EH
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper discusses the problem of increased programming time for intrinsic evolvable hardware (EHW) as the complexity of the circuit grows. We develop equations for the size of ...
123
click to vote
TIT
2008
15 years 4 months ago
2008
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
143
click to vote
ENTCS
2002
15 years 3 months ago
2002
The need to model systems and their different aspects leads to research and development of models which support all views of a system. The growing complexity of the software impos...