97 search results - page 19 / 20 » Using Generalized Constraints and Protoforms to Deal with Ad... |
83
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
115
click to vote
IJCV
2008
14 years 9 months ago
2008
This paper deals with video segmentation based on motion and spatial information. Classically, the motion term is based on a motion compensation error (MCE) between two consecutiv...
82
Voted
GIS
2008
ACM
14 years 12 months ago
2008
ACM
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
102
Voted
JAIR
2006
14 years 11 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
TASE
2008
IEEE
14 years 10 months ago
2008
IEEE
This work intends to deal with the optimal kinematic synthesis problem of parallel manipulators under a unified framework. Observing that regular (e.g., hyper-rectangular) workspac...