Sciweavers

2082 search results - page 9 / 417
» Change Paths in Reasoning!
Sort
View
EUROPAR
2009
Springer
13 years 5 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou
IEICET
2010
75views more  IEICET 2010»
13 years 6 months ago
Reasoning on the Self-Organizing Incremental Associative Memory for Online Robot Path Planning
Aram Kawewong, Yutaro Honda, Manabu Tsuboyama, Osa...
ERSHOV
1999
Springer
13 years 11 months ago
Multi-agent Optimal Path Planning for Mobile Robots in Environment with Obstacles
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
Fedor A. Kolushev, Alexander A. Bogdanov
LPAR
2010
Springer
13 years 6 months ago
Lazy Abstraction for Size-Change Termination
traction for Size-Change Termination
Michael Codish, Carsten Fuhs, Jürgen Giesl, P...
CADE
2007
Springer
14 years 7 months ago
Certified Size-Change Termination
We develop a formalization of the Size-Change Principle in Isabelle/HOL and use it to construct formally certified termination proofs for recursive functions automatically.
Alexander Krauss