10988 search results - page 2133 / 2198 » Algorithmic Folding Complexity |
107
click to vote
CSR
2010
Springer
15 years 7 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
136
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Recent advances in genotyping technology have led to the generation of an enormous quantity of genetic data. Traditional methods of statistical analysis have proved insufficient i...
152
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Evolutionary methods have been used to repair programs automatically, with promising results. However, the fitness function used to achieve these results was based on a few simpl...
141
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
126
click to vote
SACMAT
2009
ACM
15 years 7 months ago
2009
ACM
The role-based access control (RBAC) model has proven to be cost effective to reduce the complexity and costs of access permission management. To maximize the advantages offered...