Sciweavers

144 search results - page 19 / 29
» Path extendability of claw-free graphs
Sort
View
GBRPR
2009
Springer
15 years 4 months ago
On Computing Canonical Subsets of Graph-Based Behavioral Representations
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
Walter C. Mankowski, Peter Bogunovich, Ali Shokouf...
ICPP
2002
IEEE
15 years 2 months ago
Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
Dakai Zhu, Nevine AbouGhazaleh, Daniel Mossé...
DAC
2009
ACM
15 years 10 months ago
WCET-aware register allocation based on graph coloring
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...
Heiko Falk
79
Voted
IJCAI
1993
14 years 11 months ago
Using Local Information in a Non-Local Way for Mapping Graph-Like Worlds
This paper describes a technique whereby an autonomous agent such as a mobile robot can explore an unknown environment and make a topologicalmapofit. It is assumedthat the environ...
Gregory Dudek, Paul Freedman, Souad Hadjres
COMPGEOM
2010
ACM
15 years 2 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...