3514 search results - page 510 / 703 » A search space |
102
click to vote
SARA
2009
Springer
15 years 7 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
95
Voted
DATE
2008
IEEE
15 years 7 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
74
Voted
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
101
click to vote
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we study the problem of mining frequent sequences satisfying a given regular expression. Previous approaches to solve this problem were focusing on its search space,...
115
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Object detection in clutter or occlusion is a hard problem in computer vision. We propose an object detection method based on contour grouping. Two stages are included: a novel di...