29 search results - page 2 / 6 » Resolution Search and Dynamic Branch-and-Bound |
ICRA
2002
IEEE
13 years 10 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
WWCA
1998
Springer
13 years 9 months ago
1998
Springer
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
ICCV
1999
IEEE
14 years 7 months ago
1999
IEEE
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...