9842 search results - page 1451 / 1969 » The Complexity of the Matching-Cut Problem |
165
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
204
click to vote
IEEESCC
2008
IEEE
16 years 1 months ago
2008
IEEE
The semantic web services composition process arranges several web services into one composite to realize complex workflows. To do this, semantic metadata of web services’ desc...
114
click to vote
IROS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Behavior-based controllers for complex missions often are more easily designed by decomposing the mission into a series of smaller subtasks. When applying this technique to a m...
196
click to vote
IROS
2008
IEEE
16 years 1 months ago
2008
IEEE
— In many computer vision related applications it is necessary to distinguish between the background of an image and the objects that are contained in it. This is a difficult pr...
172
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...