Sciweavers

1883 search results - page 197 / 377
» Ordered theta graphs
Sort
View
IJCAI
2001
13 years 9 months ago
Causal interaction: from a high-level representation to an operational event-based representation
We propose to extend the temporal causal graph formalisms used in model-based diagnosis in order to deal with non trivial interactions like (partial) cancellation of fault effects...
Irène Grosclaude, Marie-Odile Cordier, Rene...
AUTOMATICA
2010
95views more  AUTOMATICA 2010»
13 years 8 months ago
Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...
Tove Gustavi, Dimos V. Dimarogonas, Magnus Egerste...
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 8 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
IJBIDM
2008
114views more  IJBIDM 2008»
13 years 8 months ago
Traffic mining in a road-network: How does the traffic flow?
: The flow of data coming from modern sensing devices enables the development of novel research techniques related to data management and knowledge extraction. In this work, we und...
Irene Ntoutsi, Nikos Mitsou, Gerasimos Marketos
IJES
2006
72views more  IJES 2006»
13 years 8 months ago
Non-contiguous linear placement for reconfigurable fabrics
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
Cristinel Ababei, Kia Bazargan