15073 search results - page 328 / 3015 » Probabilistic algorithms for computing resultants |
164
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
147
click to vote
EVOW
2007
Springer
15 years 8 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
175
click to vote
BMCBI
2010
15 years 5 months ago
2010
Background: Development of high-throughput methods for measuring DNA interactions of transcription factors together with computational advances in short motif inference algorithms...
162
click to vote
BMCBI
2004
15 years 4 months ago
2004
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
280
click to vote
ICC
2011
IEEE
14 years 4 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...