7106 search results - page 421 / 1422 » Restricted Complexity, General Complexity |
203
Voted
ESOP
2009
Springer
15 years 11 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
217
click to vote
CRYPTO
2006
Springer
15 years 11 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
201
Voted
IWSM
2000
Springer
15 years 11 months ago
2000
Springer
: In this article we present a method for estimating the effort of software projects following an evolutionary, object-oriented development paradigm. Effort calculation is based on...
203
click to vote
COMPGEOM
1987
ACM
15 years 11 months ago
1987
ACM
We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an r-dimensional space may be simplified to a search on an (r- l)-dimensional...
230
Voted
ACMACE
2008
ACM
15 years 9 months ago
2008
ACM
BeatBender is a computer music project that explores a new method for generating emergent rhythmic drum patterns using the subsumption architecture. Rather than explicitly coding ...