270 search results - page 25 / 54 » Dynamic Complexity Theory Revisited |
96
Voted
SPAA
2009
ACM
16 years 8 days ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
COGSCI
2010
14 years 12 months ago
2010
People are remarkably smart: They use language, possess complex motor skills, make nontrivial inferences, develop and use scientific theories, make laws, and adapt to complex dyna...
108
click to vote
LOGCOM
2007
14 years 11 months ago
2007
Structural causal models offer a popular framework for exploring causal concepts. However, due to their limited expressiveness, structural models have difficulties coping with su...
112
click to vote
POPL
2011
ACM
14 years 2 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...