1154 search results - page 214 / 231 » On the editing distance of graphs |
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The original Semantic Web vision was explicit in the need for intelligent autonomous agents that would represent users and help them navigate the Semantic Web. We argue t...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Effective encoding of information is one of the keys to qualitative problem solving. Our aim is to explore Knowledge representation techniques that capture meaningful wor...
ATMOS
2007
13 years 9 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...