Sciweavers

1132 search results - page 57 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
AAAI
2007
15 years 2 months ago
On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
Hang T. Dinh, Alexander Russell, Yuan Su
LICS
1995
IEEE
15 years 3 months ago
Tree Canonization and Transitive Closure
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
Kousha Etessami, Neil Immerman
JAIR
2010
119views more  JAIR 2010»
14 years 10 months ago
Active Tuples-based Scheme for Bounding Posterior Beliefs
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
Bozhena Bidyuk, Rina Dechter, Emma Rollon
ICRA
2007
IEEE
111views Robotics» more  ICRA 2007»
15 years 6 months ago
Upper body posture estimation for standing function restoration
— This paper addresses the problem of restoring standing in paralegia via functional electrical stimulation (FES) and investigates the relashionship between body posture and volu...
Gael Pages, Nacim Ramdani, Philippe Fraisse, David...
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 12 months ago
Arithmetic circuits: the chasm at depth four gets wider
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...
Pascal Koiran