2693 search results - page 21 / 539 » On Computing Complex Navigation Functions |
COCO
2004
Springer
14 years 3 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
COCO
1991
Springer
14 years 1 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
POPL
2008
ACM
14 years 10 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
ICCSA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The accurate prediction of Web navigation patterns has immense commercial value as the Web evolves into a primary medium for marketing and sales for many businesses. Ofte...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...