874 search results - page 164 / 175 » Faster Algorithms for Semi-Matching Problems |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
JETC
2008
13 years 7 months ago
2008
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
RECOMB
2002
Springer
14 years 9 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
PVLDB
2010
13 years 7 months ago
2010
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...