699 search results - page 62 / 140 » The method of combinatorial telescoping |
121
Voted
JSYML
2006
15 years 3 months ago
2006
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...
119
click to vote
JAR
2000
15 years 3 months ago
2000
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
123
Voted
FUIN
2010
15 years 1 months ago
2010
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
247
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
136
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
We present an approach for efficiently recognizing all objects in a scene and estimating their full pose from multiple views. Our approach builds upon a state of the art single-vie...