Sciweavers

169 search results - page 10 / 34
» Tractability of Planning with Loops
Sort
View
HICSS
2003
IEEE
136views Biometrics» more  HICSS 2003»
14 years 23 days ago
Management of Material Flows in Closed-Loop Supply Chains
Due to the latest developments in European environmental legislation, producers will be responsible for collecting, sorting and recycling of discarded products at the end of their...
Thomas Spengler
JAIR
1998
81views more  JAIR 1998»
13 years 7 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström
KR
2010
Springer
14 years 8 days ago
A Correctness Result for Reasoning about One-Dimensional Planning Problems
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
Yuxiao Hu, Hector J. Levesque
AI
2004
Springer
13 years 7 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
ICANN
2007
Springer
14 years 1 months ago
Theoretical Analysis of Accuracy of Gaussian Belief Propagation
Abstract. Belief propagation (BP) is the calculation method which enables us to obtain the marginal probabilities with a tractable computational cost. BP is known to provide true m...
Yu Nishiyama, Sumio Watanabe