Filters








59,011 Hits in 3.2 sec

The Game Saturation Number of a Graph [article]

James M. Carraher, William B. Kinnersley, Benjamin Reiniger, Douglas B. West
<span title="2014-06-11">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In the F-saturation game on H, players Max and Min alternately add edges of H to G, avoiding subgraphs in F, until G becomes F-saturated relative to H.  ...  Given a family F and a host graph H, a graph G⊆ H is F-saturated relative to H if no subgraph of G lies in F but adding any edge from E(H)-E(G) to G creates such a subgraph.  ...  The F -saturation game on a host graph H has players Max and Min.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.2834v2">arXiv:1405.2834v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/igc4wjprbbgzhdoab4s7ijgxoq">fatcat:igc4wjprbbgzhdoab4s7ijgxoq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200915063504/https://arxiv.org/pdf/1405.2834v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/fe/1efed7cdfbc11f3088737d3e1194fd9687cde896.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.2834v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

The Game Saturation Number of a Graph

James M. Carraher, William B. Kinnersley, Benjamin Reiniger, Douglas B. West
<span title="2016-09-16">2016</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ukzsjb6a6zhyxnjl6nb2mmjc6m" style="color: black;">Journal of Graph Theory</a> </i> &nbsp;
Acknowledgment The authors thank the referees for extremely careful reading that led to improvements of several proofs and results.  ...  The F-saturation game on a host graph H has players Max and Min.  ...  The game ends when a saturated set is reached, with Max and Min having the same goals as before.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.22074">doi:10.1002/jgt.22074</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x5wyqv2srjbwrjgnzk673oeyue">fatcat:x5wyqv2srjbwrjgnzk673oeyue</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200318100330/https://digitalcommons.uri.edu/cgi/viewcontent.cgi?article=1032&amp;context=math_facpubs" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5e/e6/5ee64d8343c6d234fee03ef18763ce8c307fcc30.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.22074"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Increasing throughput in IEEE 802.11 by optimal selection of backoff parameters

Ben M. Parker, Steven G. Gilmour, John Alexander Schormans
<span title="2015-01-01">2015</span> <i title="Institution of Engineering and Technology (IET)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ghoo7yee6vcx7ffz2bpjziedbe" style="color: black;">IET Networks</a> </i> &nbsp;
We use this new model to perform Monte Carlo simulation to discover the impact of the minimum and maximum contention window times (CW min and CW max ) in the standard on measures of throughput in a network  ...  By exhaustive search over a parameter space, we find optimal values for these devices for any given network model, and show that the recommended parameters in the IEEE 802.11 standard are not optimal.  ...  [20] ascribe the throughput sensitivity in an IEEE 802.11 network to the choice of the CW min and CW max backoff parameters, and show that saturation throughput depends only on the number of devices  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1049/iet-net.2013.0021">doi:10.1049/iet-net.2013.0021</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dtmvimxmm5bljpojmwlyvywvle">fatcat:dtmvimxmm5bljpojmwlyvywvle</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829214855/https://eprints.soton.ac.uk/363698/1/wirelessv13.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f0/d4/f0d4ea343b86302d4276c55b3e2aa4dc70ce989c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1049/iet-net.2013.0021"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Min-BDeu and Max-BDeu Scores for Learning Bayesian Networks [chapter]

Mauro Scanagatta, Cassio P. de Campos, Marco Zaffalon
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Because of that, they can be integrated into any state-of-the-art structure learning method that explores the space of directed acyclic graphs and allows decomposable scores.  ...  They consider the sensitivity of BDeu to varying parameters of the Dirichlet prior.  ...  Acknowledgments Work partially supported by the Swiss NSF grants Nos. 200021 146606 / 1 and 200020 137680 / 1, and by the Swiss CTI project with Hoosh Technology.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-11433-0_28">doi:10.1007/978-3-319-11433-0_28</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k7niacfbcbawzkeyszyx5we2mi">fatcat:k7niacfbcbawzkeyszyx5we2mi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922013044/http://people.idsia.ch/~marco/papers/2014pgm-minmaxbdeu.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8b/82/8b82b2a461df73aa89e63a00529faa93251179ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-11433-0_28"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Game matching number of graphs [article]

Daniel W. Cranston, William B. Kinnersley, Suil O., Douglas B. West
<span title="2012-12-30">2012</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The resulting sizes under optimal play when Max or Min starts are denoted $\Max(G)$ and $\Min(G)$, respectively. We show that always $|\Max(G)-\Min(G)|\le 1$.  ...  Whenever $G$ is a 3-regular $n$-vertex connected graph, $\Max(G) \ge n/3$, and there are such examples with $\Max(G)\le 7n/18$. For an $n$-vertex path or cycle, the answer is roughly $n/7$.  ...  The F -saturation game on a graph G is played by two players, Max and Min. The players jointly construct a subgraph H of G by alternately adding edges of G to H without completing a copy of F .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1208.0085v2">arXiv:1208.0085v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mwspp6r4qjbnnjcvti2bzsldeu">fatcat:mwspp6r4qjbnnjcvti2bzsldeu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200901054445/https://arxiv.org/pdf/1208.0085v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/27/74/2774d928bb7582da095e0133f4b8ff5929368eb5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1208.0085v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A Generalized Logistic Function and its Applications

Grzegorz Rządkowski, Lidia Sobczak
<span title="2020-01-01">2020</span> <i title="Walter de Gruyter GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/js4q4lvgcfecncwrkcnsnhnyae" style="color: black;">Foundations of Management</a> </i> &nbsp;
Starting from the Riccati differential equation with constant coefficients, we find its analytical form and describe basic properties.  ...  parameters: u max = 100, u min = 10, and c = 5 (Source: Own elaboration) Fig. 1 shows graphs of two exemplary generalized logistic functions with parameters u max = 100, u min = 10, and c = 5 for two  ...  Constants u max and u min are called the saturation level and the initial level, respectively.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/fman-2020-0007">doi:10.2478/fman-2020-0007</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/apbrbu45cfea7hx25zztoca4w4">fatcat:apbrbu45cfea7hx25zztoca4w4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200508041330/https://content.sciendo.com/downloadpdf/journals/fman/12/1/article-p85.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/89/fe89201dfaf0786c64f645b9283b6aa47260b240.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/fman-2020-0007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Measuring uncertainty in graph cut solutions

Pushmeet Kohli, Philip H.S. Torr
<span title="">2008</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dsarpzh6wfgadnyijwv5l6gh2i" style="color: black;">Computer Vision and Image Understanding</a> </i> &nbsp;
The paper also shows how min-marginals can be used for parameter learning in conditional random fields.  ...  In recent years graph cuts have become a popular tool for performing inference in Markov and Conditional Random Fields.  ...  Acknowledgements We would like to thank Sanjiv Kumar for helpful discussions regarding the use of max-marginals for parameter learning.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.cviu.2008.07.002">doi:10.1016/j.cviu.2008.07.002</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5zrk5bb7qbav7auvklk5ljkgna">fatcat:5zrk5bb7qbav7auvklk5ljkgna</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200320032005/http://www.robots.ox.ac.uk/~phst/Papers/2008/PushmeetCVIU08/kt_cviu08_final.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/34/e6/34e681fd7f88826cd8baa3a821cc7294655232ec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.cviu.2008.07.002"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Game matching number of graphs

Daniel W. Cranston, William B. Kinnersley, Suil O, Douglas B. West
<span title="">2013</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lx7dev2le5anbg6oarljwh7lie" style="color: black;">Discrete Applied Mathematics</a> </i> &nbsp;
The F -saturation game on a graph G is played by two players, Max and Min. The players jointly construct a subgraph H of G by alternately adding edges of G to H without completing a copy of F .  ...  Max plays first) and in the Min-start game (where Min plays first), respectively.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.dam.2013.03.010">doi:10.1016/j.dam.2013.03.010</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jhic5vlrh5gnxergx7tg4it2ri">fatcat:jhic5vlrh5gnxergx7tg4it2ri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171202080831/https://faculty.math.illinois.edu/~west/pubs/gamemat.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c5/ac/c5ac74e4b263947d4a05ad741e2cd825211bea52.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.dam.2013.03.010"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

P-Matchings in Graphs: A Brief Survey with Some Open Problems [article]

Todd Fenstermacher, Soumendra Ganguly, Stephen Hedetniemi, Renu Laskar
<span title="2018-05-09">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
For a graph G=(V,E), a matching M is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.  ...  The parameters of interest for onbr and cnbr matchings are β on = max{ M ∶ M is an onbr matching} β − on = min{ M ∶ M is a maximal onbr matching} β cn = max{ M ∶ M is a cnbr matching} β − cn = min{ M ∶  ...  The parameters of interest are β ur (G) = max{ M ∶ M is a ur matching} and β − ur (G) = min{ M ∶ M is a maximal ur matching}. FIGURE 2 . 2 Examples of ur (left) and not ur (right) matchings.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.03334v1">arXiv:1805.03334v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kraqsc2fyfeuxake3hkyastwhi">fatcat:kraqsc2fyfeuxake3hkyastwhi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200824001401/https://arxiv.org/pdf/1805.03334v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/73/8a/738a6c8876f5689232a50e463b8c7db2b5a7d35c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.03334v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Three power-aware routing algorithms for sensor networks

Javed Aslam, Qun Li, Daniela Rus
<span title="">2003</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6o4hgxplrbehxg4t53ub7zmfha" style="color: black;">Wireless Communications and Mobile Computing</a> </i> &nbsp;
We develop an approximation algorithm called max -min zP min that has a good empirical competitive ratio. To ensure scalability, we introduce a second online algorithm for power-aware routing.  ...  , NSF award I1S-9912193, Honda corporation, and the Sloan foundation; we are grateful for this support.  ...  Acknowledgements This work bas been supported in part by Department of Defense contract MURI F49620-97-1-0382 and DARPA contract F30602-98-2-0107, ONR grant N00014-01-1-0675, NSF CAREER award IRI-9624286  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/wcm.111">doi:10.1002/wcm.111</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yfg24sflgbfrxk3noh4xrjzk44">fatcat:yfg24sflgbfrxk3noh4xrjzk44</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060907202048/http://cmc.cs.dartmouth.edu/papers/li:wcmc.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d7/d2/d7d2f8ad455901cb986460986b688471459c9dc6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/wcm.111"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> wiley.com </button> </a>

Using random sampling to find maximum flows in uncapacitated undirected graphs

David R. Karger
<span title="">1997</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC &#39;97</a> </i> &nbsp;
Our algorithms dominate augmenting paths over all parameter values (number of vertices and edges and flow value). They also dominate blocking flows over a large range of parameter values.  ...  When no more edges can be deleted, we know that every remaining edge must be saturated to give a maximum flow.  ...  It is based on a divide-and conquer scheme. Suppose that we could quickly find an s-t min-cut in G. We know that all edges of this s-t min-cut are saturated by any max-flow.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/258533.258596">doi:10.1145/258533.258596</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/Karger97.html">dblp:conf/stoc/Karger97</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s37qdabpbfcmtdzu3rikn4wl74">fatcat:s37qdabpbfcmtdzu3rikn4wl74</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922000352/http://people.csail.mit.edu/karger/Papers/flow.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e3/aa/e3aad7b49183e5cbc49991fbe53ed860a080cf0a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/258533.258596"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Correlation Study For the Assessment of Water Quality and Its Parameters of Ganga River, Kanpur, Uttar Pradesh, India

Naseema Khatoon
<span title="">2013</span> <i title="IOSR Journals"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w5m2klgu3vbqjlhg4dbmdxq6ja" style="color: black;">IOSR Journal of Applied Chemistry</a> </i> &nbsp;
Pearson's correlation coefficient (r) value is determined using correlation matrix to identify the highly correlated and interrelated water quality parameters.  ...  To test the significance of the pair of parameters p-value is carried out and in order to test the joint effects of several independent variables, without frequent or repeated monitoring of water quality  ...  The min Chloride observed at GH4 (Oct) and the max at GH6 (June).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/5736-0538090">doi:10.9790/5736-0538090</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sesgxiglunf5fjkvomyx2xrjtm">fatcat:sesgxiglunf5fjkvomyx2xrjtm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180602074522/http://www.iosrjournals.org/iosr-jac/papers/vol5-issue3/N0538090.pdf?id=7081" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/53/d353b32b7003a1e29e91d445f64c86c8d3878464.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/5736-0538090"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Connectivity Analysis of Bipolar Fuzzy Networks

Shu Gong, Gang Hua, Wei Gao, Wubshet Ibrahim
<span title="2022-01-19">2022</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wpareqynwbgqdfodcyhh36aqaq" style="color: black;">Mathematical Problems in Engineering</a> </i> &nbsp;
When a network node or channel contains uncertainties in both positive and negative aspects, the entire network can be modeled with bipolar fuzzy graphs.  ...  This paper analyzes the influence of each vertex on the connectivity of the entire network through the definition of the connected state on the bipolar fuzzy graph.  ...  � μ P A (v P max ), min v∈V(G) μ N A (v) 􏼈 􏼉 � μ N A (v N min ), and max v∈V(G) μ N A (v) 􏼈 􏼉 � μ N A (v N max ) . en, the following statements hold: (1) CS P (v P min ) � μ P A (v P min ) and CS  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2022/6398599">doi:10.1155/2022/6398599</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hzfycznr7zbmfhwa7nvrwiol3u">fatcat:hzfycznr7zbmfhwa7nvrwiol3u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220121030720/https://downloads.hindawi.com/journals/mpe/2022/6398599.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/8d/f48d86737adf46eaaae0fafafdbb839b7ff63da3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2022/6398599"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Distributed Optimal Lexicographic Max-Min Rate Allocation in Solar-Powered Wireless Sensor Networks

Shusen Yang, Julie A. Mccann
<span title="2014-07-17">2014</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e3vu3d3hbvemxbpbpbo5yyghdm" style="color: black;">ACM transactions on sensor networks</a> </i> &nbsp;
Lexicographic Max-min (LM) rate allocation is a good solution, but is non-trivial for multi-hop WSNs, as both fairness and sensing rates have to be optimized through the exploration of all possible forwarding  ...  We also evaluate our algorithms via experiments on both solar-powered MicaZ motes and extensive simulations using real solar energy data and practical power parameter settings.  ...  In addition, not arbitrary given parameters (e.g. B 1 x and E leak ) would result in a feasible solution of the LPM problem, i.e. EC max x ∈ (E min , E max ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2630882">doi:10.1145/2630882</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4ti2xoeajzbshltp432lme3cni">fatcat:4ti2xoeajzbshltp432lme3cni</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706060426/http://spiral.imperial.ac.uk/bitstream/10044/1/17864/2/TOSN.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/54/1d/541d6b45db6176eec5b816f2964e8fa3037b21c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2630882"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Fiedler–Pták scaling in max algebra

Sergei˘ Sergeev
<span title="">2013</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wsx3rzhpingfvewcn5nwhfkq3e" style="color: black;">Linear Algebra and its Applications</a> </i> &nbsp;
This is essentially the text of my talk on Fiedler-Ptak scaling in max algebra delivered in the invited minisymposium in honor of Miroslav Fiedler at the 17th ILAS Conference in Braunschweig, Germany.  ...  There are also max-plus and min-plus versions of max algebra.  ...  of any saturation graph).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.laa.2011.12.039">doi:10.1016/j.laa.2011.12.039</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n2y5pqkyt5h7pecjb52zumvldy">fatcat:n2y5pqkyt5h7pecjb52zumvldy</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1110.4598/1110.4598.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.laa.2011.12.039"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 59,011 results