689 search results - page 36 / 138 » A Modal-Logic Based Graph Abstraction |
AUSAI
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
PAKDD
2011
ACM
13 years 22 days ago
2011
ACM
Abstract. Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectr...
PUK
2000
13 years 11 months ago
2000
Abstract. In the stream of research that aims to speed up practical planners, we propose a new approach to task planning based on Probabilistic Roadmap Methods (PRM). Our contribut...
SMC
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
ACCV
2006
Springer
14 years 3 months ago
2006
Springer
Abstract. This paper addresses the problem of super resolution - obtaining a single high-resolution image given a set of low resolution images which are related by small displaceme...