نتایج جستجو برای: tarjans algorithm strongly connected components

تعداد نتایج: 1403392  

Journal: :Theor. Comput. Sci. 2000
Lefteris M. Kirousis Evangelos Kranakis Danny Krizanc Andrzej Pelc

In this paper we study the problem of assigning transmission ranges to the nodes of a multihop packet radio network so as to minimize the total power consumed under the constraint that adequate power is provided to the nodes to ensure that the network is strongly connected (i.e., each node can communicate along some path in the network to every other node). Such assignment of transmission range...

2016
Dalila Durães Sérgio Gonçalves Davide Carneiro Javier Bajo Paulo Novais

In the current world, performance is one of the most important issues concerning work and competition. Performance is strongly connected with learning and when it comes to acquiring new knowledge, attention is one the most important mechanisms as the level of the learner’s attention affects learning results. When students are doing learning activities using new technologies, it is extremely imp...

Journal: :Theor. Comput. Sci. 2016
Rogério Reis Emanuele Rodaro

We introduce the notion of reset left regular decomposition of an ideal regular language and we prove that the category formed by these decompositions with certain morphisms is equivalent to the category of strongly connected synchronizing automata. We show that each ideal regular language has at least a reset left regular decomposition. As a consequence, each ideal regular language is the set ...

2009
Raul Ramos Jordi Surinach Manuel Artís

Regional Economic Growth and Human Capital: The Role of Overeducation The paper analyses the link between human capital and regional economic growth in the European Union. Using various indicators of human capital calculated from census microdata, we conclude that the recent economic performance of European regions is associated with an increase in overeducation. In fact, measures of educationa...

2011
Ignasi Gómez-Sebastià Sergio Álvarez-Napagao Javier Vázquez-Salceda

Norms can be used in the scope of distributed computational systems to provide reliable contexts of interaction between parties where acceptable behaviour is specified in terms of regulations or guidelines. These have been explored in various formalisations, and many are the theoretical frameworks that allow to implement and operationalise them. However, when applying these frameworks to comple...

2006
Marc Aiguier Pierre-Yves Schobbens

Since A. Robinson’s work, this result has been shown valid for a large class of logic and recently has received generalizations in institutions [8]. One of the main reason why a logic should have RCP is because of “modular theory building”. Indeed, RCP has been shown to be equivalent to Craig’s interpolation property (CIP), and CIP is strongly connected to modularity in specification theory [2,...

2013
ABDULJALIL RADMAN NASHARUDDIN ZAINAL MAHAMOD ISMAIL

This paper proposes a computationally efficient eyelid detection algorithm for detecting eyelid boundaries in iris images acquired under less constrained imaging conditions. The proposed eyelid detection algorithm is developed based on the live-wire technique. The major advantage of the proposed algorithm is its computational simplicity as compared to the prior eyelid detection algorithms. The ...

Journal: :CoRR 2016
Daniel Fullmer Lili Wang A. Stephen Morse

Abstract: A distributed algorithm is described for finding a common fixed point of a family of m > 1 nonlinear maps Mi : IR n → IR assuming that each map is a paracontraction. The common fixed point is simultaneously computed by m agents assuming each agent i knows only Mi, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its ...

Journal: :Wireless Networks 2010
Hanan Shpungin Michael Segal

Given a wireless network, we want to assign each node a transmission power, which will enable transmission between any two nodes (via other nodes). Moreover, due to possible faults, we want to have at least k vertex-disjoint paths from any node to any other, where k is some fixed integer, depending on the reliability of the nodes. The goal is to achieve this directed k-strong connectivity with ...

2007
Catalin Dima

We give a generalization of a solution by Puri to the problem of checking emptiness in timed automata with drifting clocks for the case of automata with non-closed guards. We show that non-closed guards pose certain specific problems which cannot be handled by Puri’s algorithm, and propose a new algorithm, based on the idea of “boundary clock regions” of Alur, LaTorre and Pappas. We then give a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید