15073 search results - page 371 / 3015 » Probabilistic algorithms for computing resultants |
132
click to vote
TWC
2008
15 years 5 months ago
2008
Abstract -We study the problem of communication reliability and diversity in multi-hop wireless networks. Our aim is to develop a new network model that better takes into account t...
143
click to vote
JMLR
2002
15 years 4 months ago
2002
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
175
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
179
click to vote
BMCBI
2010
15 years 5 months ago
2010
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
236
click to vote
GPEM
2011
15 years 2 days ago
2011
In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function’s parameters for computer chess. Our results show that using an appropr...