1816 search results - page 67 / 364 » A New Approach for Solving the Maximum Clique Problem |
191
click to vote
ISSTA
1998
ACM
15 years 10 months ago
1998
ACM
Automatic test data generation leads to identify input values on which a selected point in a procedure is executed. This paper introduces a new method for this problem based on co...
150
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
132
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
This paper presents a new method for computing optimal L1
solutions for vision geometry problems, particularly for those
problems of fixed-dimension and of large-scale. Our strat...
151
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper studies the problem of multibody motion segmentation, which is an important, but challenging problem due to its well-known chicken-and-egg-type recursive character. We ...
140
click to vote
AIPS
2010
15 years 8 months ago
2010
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...