Sciweavers

21324 search results - page 92 / 4265
» Making the case for computing
Sort
View
COCO
2005
Springer
153views Algorithms» more  COCO 2005»
14 years 3 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
Arfst Nickelsen, Birgit Schelm
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 2 months ago
Solving quadratic assignment problems by genetic algorithms with GPU computation: a case study
Ì × Ô Ô Ö × Ö × × Ò Ò Ô Ö ÐÐ Ð Û Ø ÈÍ Óѹ ÔÙØ Ø ÓÒ ØÓ ×ÓÐÚ Ø ÕÙ Ö Ø ×× ÒÑ ÒØ ÔÖÓ Ð Ñ ´É ȵ Û × ÓÒ Ó Ø Ö ×Ø ÓÔØ ...
Shigeyoshi Tsutsui, Noriyuki Fujimoto
EUROSEC
2008
ACM
13 years 12 months ago
Case study: automated security testing on the trusted computing platform
Gergely Tóth, Gábor Koszegi, Zolt&aa...