We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
In this paper, we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resu...
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, A. Mi...
In the ForMoSA project [17] an integrated approach for safety analysis of critical, embedded systems has been developed. The approach brings together the best of engineering practi...
Frank Ortmeier, Andreas Thums, Gerhard Schellhorn,...
The efficient simulation of multi-agent systems presents particular challenges which are not addressed by current parallel discrete event simulation (PDES) models and techniques. ...
Michael Lees, Brian Logan, Rob Minson, Ton Oguara,...