Sciweavers

2834 search results - page 8 / 567
» Representing Trees with Constraints
Sort
View
AAAI
1997
13 years 9 months ago
Representing Sequences in Description Logics
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
Haym Hirsh, Daniel Kudenko
ICRA
2000
IEEE
121views Robotics» more  ICRA 2000»
13 years 11 months ago
Using Multiple Gaussian Hypotheses to Represent Probability Distributions for Mobile Robot Localization
A new mobile robot localization technique is presented which uses multiple Gaussian hypotheses to represent the probability distribution of the robots location in the environment....
David J. Austin, Patric Jensfelt
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
ICNP
2005
IEEE
14 years 1 months ago
Intersection Characteristics of End-to-End Internet Paths and Trees
This paper focuses on understanding the scale and the distribution of “state overhead” (briefly load) that is incurred on the routers by various value-added network services,...
Sevcan Bilir, Kamil Saraç, Turgay Korkmaz
RTA
2000
Springer
13 years 11 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren