3897 search results - page 334 / 780 » complexity 2010 |
183
click to vote
NICSO
2010
Springer
15 years 10 months ago
2010
Springer
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
149
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
175
Voted
ITP
2010
15 years 10 months ago
2010
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
179
click to vote
PERCOM
2010
ACM
15 years 10 months ago
2010
ACM
—Efficient discovery of nearby devices and services is one of the preconditions to obtain a usable pervasive environment. Typical user interfaces in these environments hide the ...
166
click to vote
PERCOM
2010
ACM
15 years 10 months ago
2010
ACM
—Modern mobile phones are an appealing platform for pervasive computing applications. However, the complexity of these devices makes it difficult for developers to understand th...