882 search results - page 134 / 177 » Local Search for Very Large SAT Problems |
143
click to vote
IJCV
2008
15 years 3 months ago
2008
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
132
click to vote
COLING
2000
15 years 5 months ago
2000
We present statistical models for morphological disambiguation in agglutinative languages, with a specific application to Turkish. Turkish presents an interesting problem for stati...
141
click to vote
CVPR
2011
IEEE
14 years 12 months ago
2011
IEEE
Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges o...
156
click to vote
JSAC
2008
15 years 3 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
151
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...