2905 search results - page 418 / 581 » Formal Memetic Algorithms |
134
Voted
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabil...
188
click to vote
GEOS
2009
Springer
15 years 8 months ago
2009
Springer
As directories of named places, gazetteers link the names to geographic footprints and place types. Most existing gazetteers are managed strictly top-down: entries can only be adde...
196
click to vote
SAS
2001
Springer
15 years 8 months ago
2001
Springer
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
149
Voted
PLDI
1997
ACM
15 years 8 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
117
Voted
CIE
2010
Springer
15 years 7 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...