4036 search results - page 617 / 808 » Formal Methods |
186
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
154
click to vote
SIGMOD
1995
ACM
15 years 10 months ago
1995
ACM
When querying a temporal database, a user often makes certain semantic assumptions on stored temporal data. This paper formalizes and studies two types of semantic assumptions: po...
168
click to vote
AAAI
2007
15 years 8 months ago
2007
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
135
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to con...
189
click to vote
CC
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...