Sciweavers

4110 search results - page 252 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
FLAIRS
2008
15 years 9 months ago
Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
Lukás Chrpa, Roman Barták
RTA
2010
Springer
15 years 8 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
WSC
2000
15 years 8 months ago
Simulation of an evolutionary tuned fuzzy dispatching system for automated guided vehicles
This paper presents the development and simulation of a novel Genetic Algorithm (GA) based methodology applied to optimal tuning of a fuzzy dispatching system for a fleet of autom...
Kok Kiong Tan, K. Z. Tang
AROBOTS
2004
104views more  AROBOTS 2004»
15 years 6 months ago
A Set Theoretic Approach to Dynamic Robot Localization and Mapping
This paper addresses the localization and mapping problem for a robot moving through a (possibly) unknown environment where indistinguishable landmarks can be detected. A set theo...
Mauro Di Marco, Andrea Garulli, Antonio Giannitrap...
JC
2000
78views more  JC 2000»
15 years 6 months ago
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
Fabrice Rouillier, Marie-Françoise Roy, Moh...