Sciweavers

773 search results - page 82 / 155
» Traversing the Machining Graph
Sort
View
ICCS
2007
Springer
15 years 4 months ago
Learning Common Outcomes of Communicative Actions Represented by Labeled Graphs
We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in te...
Boris Galitsky, Boris Kovalerchuk, Sergei O. Kuzne...
IPPS
2003
IEEE
15 years 3 months ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...
ERSHOV
1999
Springer
15 years 2 months ago
Enhanced Control Flow Graphs in Montages
A semi-visual framework for the speci cation of syntax and semantics of imperative programming languages, called Montages, was proposed in an earlier work by the authors. The prima...
Matthias Anlauff, Philipp W. Kutter, Alfonso Piera...
EUROPAR
1998
Springer
15 years 1 months ago
Analysing an SQL Application with a BSPlib Call-Graph Profiling Tool
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
Jonathan M. D. Hill, Stephen A. Jarvis, Constantin...
ENDM
2006
70views more  ENDM 2006»
14 years 9 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich