Sciweavers

3471 search results - page 377 / 695
» Obstacle Numbers of Graphs
Sort
View
SIROCCO
2007
15 years 8 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...
AIPS
2003
15 years 8 months ago
Reasoning about Autonomous Processes in an Estimated-Regression Planner
We examine the issues that arise in extending an estimatedregression (ER) planner to reason about autonomous processes that run and have continuous and discrete effects without th...
Drew V. McDermott
EUSFLAT
2003
161views Fuzzy Logic» more  EUSFLAT 2003»
15 years 8 months ago
Fuzzy interpolation and level 2 gradual rules
Functional laws may be known only at a finite number of points, and then the function can be completed by interpolation techniques obeying some smoothness conditions. We rather pr...
Sylvie Galichet, Didier Dubois, Henri Prade
PUK
2003
15 years 8 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
SIROCCO
1997
15 years 8 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende