2905 search results - page 354 / 581 » Formal Memetic Algorithms |
251
click to vote
PLDI
2009
ACM
16 years 4 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
127
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
136
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
140
Voted
KDD
2005
ACM
16 years 4 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
220
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...