829 search results - page 159 / 166 » Distance domination-critical graphs |
AIPS
2008
14 years 11 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
110
click to vote
CIVR
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
75
Voted
DIALM
2008
ACM
14 years 11 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}...
100
click to vote
ECAI
2008
Springer
14 years 11 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...
84
Voted
ESWS
2008
Springer
14 years 11 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...