9842 search results - page 1313 / 1969 » The Complexity of the Matching-Cut Problem |
213
click to vote
AAAI
1996
15 years 8 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
192
click to vote
IJCAI
1989
15 years 8 months ago
1989
This paper describes an approach to robotic control that is patterned after models of human skill acquisition. The intent is to develop robots capable of learning how to accomplis...
211
Voted
SODA
1992
ACM
15 years 8 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
202
click to vote
DAC
2010
ACM
15 years 8 months ago
2010
ACM
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
211
click to vote
DAGM
2010
Springer
15 years 8 months ago
2010
Springer
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...