2192 search results - page 107 / 439 » Algorithms for Challenging Motif Problems |
146
Voted
IPSN
2005
Springer
15 years 8 months ago
2005
Springer
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
128
click to vote
ISCI
2008
15 years 2 months ago
2008
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
140
click to vote
JMLR
2010
15 years 1 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
129
Voted
JMLR
2006
15 years 2 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
IROS
2007
IEEE
15 years 9 months ago
2007
IEEE
— This paper introduces a new challenge problem, designing robotic systems to recover after disassembly from high energy events. Implementation of a camera-based localization alg...