Filters








992 Hits in 3.9 sec

On the Tractability of Digraph-Based Task Models

Martin Stigge, Pontus Ekberg, Nan Guan, Wang Yi
2011 2011 23rd Euromicro Conference on Real-Time Systems  
A recently proposed model, the digraph real-time task model (DRT), offers high expressiveness well beyond traditional periodic task models.  ...  Still, the associated feasibility problem on preemptive uniprocessors remains tractable.  ...  With this clear picture of the expressiveness of graph-based models, we plan to develop a tool based on our prototype implementation incorporating the described methods.  ... 
doi:10.1109/ecrts.2011.23 dblp:conf/ecrts/StiggeEGY11 fatcat:wshovp74qzfdzoxgyspdhjxgei

Digraph width measures in parameterized algorithmics

Robert Ganian, Petr Hliněný, Joachim Kneis, Alexander Langer, Jan Obdržálek, Peter Rossmanith
2014 Discrete Applied Mathematics  
On the positive side, we also note that taking Kanté's directed generalization of rank-width as a parameter makes many problems fixed parameter tractable.  ...  In contrast to undirected width measures (such as treewidth or clique-width), which have provided many important algorithmic applications, analogous measures for digraphs such as DAGwidth or Kelly-width  ...  This work has been supported by a Czech-German bilateral grant of GAČR and DFG (201/09/J021 and RO 927/9). Moreover, P. Hliněný has been supported by the Czech research grant GAČR 201/08/0308.  ... 
doi:10.1016/j.dam.2013.10.038 fatcat:jw3g26o5gvc7dnk4mhsp2nnmkm

Simulation Study of Two Measures of Integrated Information [article]

Suresh Jois, Nithin Nagaraj
2017 arXiv   pre-print
Many authors have proposed Quantitative Theories of Consciousness (QTC) based on theoretical principles like information theory, Granger causality and complexity.  ...  Recently, Virmani and Nagaraj (arXiv:1608.08450v2 [cs.IT]) noted the similarity between Integrated Information and Compression-Complexity, and on this basis, proposed a novel measure of network complexity  ...  Note: The data and discussions presented in this paper are based on single trial simulations.  ... 
arXiv:1706.09570v1 fatcat:6tupf72jqzbshg25knap2wucma

Schedulability Analysis of Periodic Tasks Implementing Synchronous Finite State Machines

Haibo Zeng, Marco Di Natale
2012 2012 24th Euromicro Conference on Real-Time Systems  
Model-based design of embedded systems using Synchronous Reactive (SR) models is among the best practices for software development in the automotive and aeronautics industry.  ...  In this paper, we discuss the schedulability analysis of such systems, including the applicability of traditional task analysis methods and an algorithmic solution to compute the exact demand and request  ...  A classification of task models can be attempted based on the concept of task graph.  ... 
doi:10.1109/ecrts.2012.30 dblp:conf/ecrts/ZengN12 fatcat:weimxai3tfgxnidhrphtzhbtmm

The Digraph Real-Time Task Model

Martin Stigge, Pontus Ekberg, Nan Guan, Wang Yi
2011 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium  
In this paper, we advance the state-of-the-art with a model that is free from these constraints. Our proposed task model is based on arbitrary directed graphs (digraphs) for job releases.  ...  We show that the feasibility problem on preemptive uniprocessors for our model remains tractable. This even holds in the case of task systems with arbitrary deadlines.  ...  THE DIGRAPH REAL-TIME TASK MODEL A digraph real-time (DRT) task system τ = {T 1 , . . . , T N } consists of N independent tasks. A task T is characterized by a directed graph G(T ).  ... 
doi:10.1109/rtas.2011.15 dblp:conf/rtas/StiggeEGY11 fatcat:q2bjxiufyrafxj6gzqtzxoft4y

Backdoors to Tractable Answer-Set Programming [article]

Johannes Klaus Fichte, Stefan Szeider
2014 arXiv   pre-print
In this paper we use the concept of backdoors to identify new restrictions that make ASP problems tractable.  ...  We demonstrate how backdoors can serve as a unifying framework that accommodates several tractable restrictions of ASP known from the literature.  ...  . ⊣ ASP-Parameters Based on Backdoor Size Backdoor-based ASP-parameters can be related to each other in terms of their underlying base classes.  ... 
arXiv:1104.2788v4 fatcat:yqw5o7cilrgs3h46nygisggpha

Computing periodic request functions to speed-up the analysis of non-cyclic task models

Haibo Zeng, Marco Di Natale
2014 Real-time systems  
activations of the source job) allow for efficient schedulability analysis based on the periodicity of the request and demand bound functions (rbf and dbf).  ...  Several models have been proposed to represent conditional executions and dependencies among concurrent tasks for the purpose of schedulability analysis.  ...  The analysis on the resulting task model is tractable, i.e., no worse than pseudo-polynomial time for bounded utilization systems.  ... 
doi:10.1007/s11241-014-9209-5 fatcat:mayz6looc5cn3knlnnp5ligm7e

Pure Nash Equilibria: Complete Characterization of Hard and Easy Graphical Games [article]

Albert Xin Jiang, MohammadAli Safari
2010 arXiv   pre-print
In this work, we provide such a characterization for the case of bounded in-degree graphs, thereby resolving the gap between existing hardness and tractability results.  ...  It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special classes of graphs such as those with bounded treewidth.  ...  These kinds of computational tasks can be understood in the language of AI as reasoning about the game: what are the likely outcomes of the game, under certain models of rationality of the agents?  ... 
arXiv:1002.1363v1 fatcat:5mg2u3eq6za4hgxtejrcqt4jmm

Some Complexity Considerations in the Combination of Belief Networks [article]

Izhar Matzkevich, Bruce Abramson
2013 arXiv   pre-print
One topic that is likely to attract an increasing amount of attention within the Knowledge-base systems research community is the coordination of information provided by multiple experts.  ...  One approach to such a consensus is the fusion of the contributed networks into a single, consensus model prior to the consideration of any case-specific data (specific observations, test results).  ...  These heuristics should proba bly be based on a combination of the domain being modeled and the topology of the contributed mod els. Research on this topic is currently underway.  ... 
arXiv:1303.1472v1 fatcat:sadbktihcngyzdborwg3rn4ty4

The Complexity of Object Association in Multiple Object Tracking

Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2021 AAAI Conference on Artificial Intelligence  
Two prominent models capturing this task have been introduced in the literature: the Lifted Multicut model and the more recent Lifted Paths model.  ...  ., the identification of which observations correspond to the same object, is a central task for the area of multiple object tracking.  ...  Acknowledgements Robert Ganian and Thekla Hamm acknowledge support by the Austrian Science Fund (FWF, projects P31336 and Y 1329).  ... 
dblp:conf/aaai/GanianHO21 fatcat:as2ybm35nbb5dmzavcz23vrrkm

On Digraph Width Measures in Parameterized Algorithmics [chapter]

Robert Ganian, Petr Hliněný, Joachim Kneis, Alexander Langer, Jan Obdržálek, Peter Rossmanith
2009 Lecture Notes in Computer Science  
On the positive side, we also note that taking Kanté's directed generalization of rank-width as a parameter makes many problems fixed parameter tractable.  ...  In contrast to undirected width measures (such as treewidth or clique-width), which have provided many important algorithmic applications, analogous measures for digraphs such as DAGwidth or Kelly-width  ...  Hliněný has also been supported by the Czech research grant GAČR 201/08/0308.  ... 
doi:10.1007/978-3-642-11269-0_15 fatcat:sfsofgaccbhfzery6rjzejf5ku

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs [article]

Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
2018 arXiv   pre-print
In this way, we obtain fixed-parameter tractability and polynomial kernelizability results, with the central parameter being the maximum vertex in- or outdegree of the output digraph.  ...  There has been intensive work on the parameterized complexity of the typically NP-hard task to edit undirected graphs into graphs fulfilling certain given vertex degree constraints.  ...  [26] showed fixed-parameter tractability with respect to the maximum degree ∆ G of the input graph. This result was based on showing that ∆ * ∈ O(∆ 2 G ).  ... 
arXiv:1604.06302v3 fatcat:ezo26nmmn5dbdm3dbb3qtzp4y4

On the complexity of existential positive queries

Hubie Chen
2014 ACM Transactions on Computational Logic  
Overall, the tools, concepts, and results of this article set the stage for the future consideration of the complexity of model checking on more expressive logics.  ...  We systematically investigate the complexity of model checking the existential positive fragment of first-order logic.  ...  The author thanks Johan Thapper for useful comments. References  ... 
doi:10.1145/2559946 fatcat:s2o4gwaldvfari5qziuiosm7hi

On the Complexity of Existential Positive Queries [article]

Hubie Chen
2012 arXiv   pre-print
Overall, the tools, concepts, and results of this article set the stage for the future consideration of the complexity of model checking on more expressive logics.  ...  We systematically investigate the complexity of model checking the existential positive fragment of first-order logic.  ...  The author thanks Johan Thapper for useful comments. References  ... 
arXiv:1206.3902v2 fatcat:75essvvrq5gcjbsmola6yu7zri

A Graph-Based Approach for Classifying OWL 2 QL Ontologies

Domenico Lembo, Valerio Santarelli, Domenico Fabio Savo
2013 International Workshop on Description Logics  
In this paper, we provide a new algorithm for ontology classification in OWL 2 QL, which is based on the idea of encoding the ontology TBox into a directed graph and reducing core reasoning to computation  ...  OWL 2 QL is a tractable profile of OWL 2 for which ontology classification is polynomial in the size of the ontology TBox.  ...  This research has been partially supported by the EU under FP7 project Optique (grant n. FP7-318338), and by the EU under FP7-ICT project ACSI (grant no. 257593).  ... 
dblp:conf/dlog/LemboSS13 fatcat:crx5bq4csvdytjjmx7wmnm4enm
« Previous Showing results 1 — 15 out of 992 results