13987 search results - page 438 / 2798 » The Two Guards Problem |
178
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
173
click to vote
DAC
1999
ACM
16 years 8 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
146
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
192
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Mobile robots often rely upon systems that render sensor data and perceptual features into costs that can be used in a planner. The behavior that a designer wishes the planner to ...
166
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...