728 search results - page 9 / 146 » Efficient Searching with Linear Constraints |
116
click to vote
AAAI
2010
15 years 3 months ago
2010
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
119
click to vote
COR
2010
15 years 1 months ago
2010
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
123
Voted
COLING
2008
15 years 3 months ago
2008
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...
132
click to vote
FLAIRS
2004
15 years 3 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
117
Voted
ICIP
2010
IEEE
14 years 11 months ago
2010
IEEE
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...