1253 search results - page 207 / 251 » Convergence of Evolutionary Algorithms in General Search Spa... |
161
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
162
click to vote
ESWS
2007
Springer
16 years 10 days ago
2007
Springer
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
166
click to vote
IWCMC
2006
ACM
16 years 4 days ago
2006
ACM
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
169
click to vote
GECCO
2007
Springer
16 years 10 days ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
182
click to vote
CGO
2008
IEEE
16 years 19 days ago
2008
IEEE
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...