1022 search results - page 93 / 205 » Logspace Complexity of Functions and Structures |
COMPSAC
2002
IEEE
15 years 2 months ago
2002
IEEE
Achievement of quality in software design, while never easy, is made more difficult by the inherent complexity of hard real-time (HRT) design. Furthermore, timing requirements in...
FSE
1993
Springer
15 years 2 months ago
1993
Springer
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
MP
2008
14 years 10 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
TOG
2008
14 years 9 months ago
2008
We introduce a meshless hierarchical representation for solving light transport problems. Precomputed radiance transfer (PRT) and finite elements require a discrete representation...
110
click to vote
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
— Despite their success as optimization methods, evolutionary algorithms face many difficulties to design artifacts with complex structures. According to paleontologists, living...