1088 search results - page 160 / 218 » A Bayesian Approach to Tackling Hard Computational Problems |
117
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
142
Voted
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
90
Voted
BMCBI
2007
15 years 23 days ago
2007
Background: In practice many biological time series measurements, including gene microarrays, are conducted at time points that seem to be interesting in the biologist's opin...
103
click to vote
CCR
2000
15 years 14 days ago
2000
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
103
Voted
ML
2008
ACM
15 years 18 days ago
2008
ACM
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...