Sciweavers

4355 search results - page 175 / 871
» Increasing Kolmogorov Complexity
Sort
View
DAC
2012
ACM
13 years 1 months ago
Is dark silicon useful?: harnessing the four horsemen of the coming dark silicon apocalypse
Due to the breakdown of Dennardian scaling, the percentage of a silicon chip that can switch at full frequency is dropping exponentially with each process generation. This utiliza...
Michael B. Taylor
WDAG
2005
Springer
85views Algorithms» more  WDAG 2005»
15 years 4 months ago
Time and Space Lower Bounds for Implementations Using k-CAS
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
Hagit Attiya, Danny Hendler
COMPSAC
2002
IEEE
15 years 3 months ago
A Graphically Based Language for Constructing, Executing and Analysing Models of Software Systems
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...
Robert John Walters
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 2 months ago
Sporadic model building for efficiency enhancement of hierarchical BOA
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
Martin Pelikan, Kumara Sastry, David E. Goldberg
GPEM
2008
98views more  GPEM 2008»
14 years 10 months ago
Sporadic model building for efficiency enhancement of the hierarchical BOA
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
Martin Pelikan, Kumara Sastry, David E. Goldberg