886 search results - page 69 / 178 » Reasoning with contextual graphs |
161
Voted
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
230
click to vote
GIS
2008
ACM
16 years 5 months ago
2008
ACM
In this paper we propose to apply hierarchical graphs to indoor navigation. The intended purpose is to guide humans in large public buildings and assist them in wayfinding. We sta...
123
click to vote
FLOPS
2010
Springer
15 years 11 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
142
click to vote
LOPSTR
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
156
click to vote
FASE
2005
Springer
15 years 9 months ago
2005
Springer
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...