Filters








68,074 Hits in 5.8 sec

The Graph Exploration Problem with Advice [article]

Hans-Joachim Böckenhauer and Janosch Fuchs and Walter Unger
2018 arXiv   pre-print
In this work, we present algorithms with an advice complexity of O(m+n), thus improving the classical bound for sparse graphs.  ...  The graph exploration problem is a theoretical and abstract model, where an algorithm has to decide how the agent, also called explorer, moves through a network such that every point of interest is visited  ...  [5] in this XX:4 The Graph Exploration Problem with Advice Table 1 Upper bounds on the advice complexity of graph exploration graph model exploration upper bound unknown directed cyclic 2n + 23m unknown  ... 
arXiv:1804.06675v1 fatcat:dxdwhf7llfbbhgfu3apbcciuva

Online Graph Exploration with Advice [chapter]

Stefan Dobrev, Rastislav Královič, Euripides Markou
2012 Lecture Notes in Computer Science  
We study the problem of exploring an unknown undirected graph with non-negative edge weights.  ...  This variant of the exploration problem has been introduced by Kalyanasundaram and Pruhs in [18] and is known as a fixed graph scenario.  ...  In the online graph exploration problem an agent starts at a node s of an undirected labeled graph G = (V, E), with |V | denoted by n.  ... 
doi:10.1007/978-3-642-31104-8_23 fatcat:gmdb5k2p4ja3hbvmarlxrbegfq

Deterministic Graph Exploration with Advice [article]

Barun Gorain, Andrzej Pelc
2016 arXiv   pre-print
The instance oracle knows the entire instance of the exploration problem, i.e., the port-numbered map of the graph and the starting node of the agent in this map.  ...  We consider the problem of how much knowledge the agent has to have a priori, in order to explore the graph in a given time, using a deterministic algorithm.  ...  We are grateful to Adrian Kosowski for early discussions on the subject of this paper and for drawing our attention to [10] .  ... 
arXiv:1607.01657v2 fatcat:bquyxeut6bfj3ngxqqmtu6bciy

Computing with Advice: when Knowledge Helps

Stefan Dobrev, Rastislav Královic, Richard Královic
2013 Bulletin of the European Association for Theoretical Computer Science  
Recently, a number of authors have proposed a quantitative approach, where the amount of the added information is studied in relation with the improvement of the quality or efficiency of the solution.  ...  Traditionally, a qualitative approach to the study of this information has been pursued, in which the impact of enhancing the algorithm with various specific types of information has been studied.  ...  The problems related to graph exploration are presumably the oldest graph-theoretic problems (e. g., [39] ).  ... 
dblp:journals/eatcs/DobrevKK13 fatcat:xnr3z6ibhvcddbulvj6jtt2d5i

Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs [article]

Sebastian Brandt and Klaus-Tycho Foerster and Jonathan Maurer and Roger Wattenhofer
2020 arXiv   pre-print
We study the problem of online graph exploration on undirected graphs, where a searcher has to visit every vertex and return to the origin.  ...  We investigate the problem on tadpole graphs (also known as dragons, kites), which consist of a cycle with an attached path. Miyazaki et al.  ...  We would like to thank Nicole Megow for her feedback on the related work.  ... 
arXiv:1903.00581v3 fatcat:cvfv53ezxjgxxm3iww2qd5vvge

Tree exploration with advice

Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2008 Information and Computation  
After the publication of the preliminary (conference) version of this paper, the advice paradigm has been used to investigate various other network problems: in [22] to study distributed graph coloring  ...  Given a problem P with the set of instances I, an oracle is a function O : I → {0,1} * that maps any instance I to a binary string O(I), called the advice of oracle O on instance I.  ...  explored graph with the starting node marked.  ... 
doi:10.1016/j.ic.2008.07.005 fatcat:pcyrxybkprh3zdr7ivoksl7jaa

Communication algorithms with advice

Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2010 Journal of computer and system sciences (Print)  
We show that the minimum size of advice permitting the wakeup with a linear number of messages in a n-node network, is Θ(n log n), while the broadcast with a linear number of messages can be achieved with  ...  We also show that the latter size of advice is almost optimal: no advice of size o(n) can permit to broadcast with a linear number of messages.  ...  On the other hand, in [8] the authors investigate the exploration of various types of graphs when the exploring agent is provided with an unlabeled map of the graph, and show how the cost of exploration  ... 
doi:10.1016/j.jcss.2009.07.002 fatcat:bnu6bjv7jfhxbfprkuxang6my4

Fast Rendezvous with Advice [article]

Avery Miller, Andrzej Pelc
2014 arXiv   pre-print
The oracle helps the agents by providing them with the same binary string called advice, which can be used by the agents during their navigation.  ...  The matching lower bound, which is the main contribution of this paper, is proved by exhibiting classes of networks for which it is impossible to achieve rendezvous in time Θ(D) with smaller advice.  ...  In [30] the authors studied the problem of topology recognition with advice given to nodes.  ... 
arXiv:1407.1428v2 fatcat:tkavgdm7gbdi3mcvez2d4gnhda

Verification Based Solution for Structured MAB Problems

Zohar S. Karnin
2016 Neural Information Processing Systems  
We demonstrate the effectiveness of our framework by applying it, and matching or improving the state-of-the art results in the problems of: Linear bandits, Dueling bandits with the Condorcet assumption  ...  of the classic MAB problem.  ...  Our framework is based on the fact that in MAB problems with structure, it is often easier to design an algorithm for verifying a candidate arm is the best one, rather than discovering the identity of  ... 
dblp:conf/nips/Karnin16 fatcat:vawtcytaivfnthkqwehobbmtaq

Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt [article]

Avery Miller, Andrzej Pelc
2015 arXiv   pre-print
Our goal is to find the smallest size of advice which enables the agents to solve these tasks at some cost C in a network with e edges.  ...  For arbitrary graphs, we give upper and lower bounds of O(D(D·e/C) + e) and Ω(De/C), respectively, on the optimal size of advice.  ...  Acknowledgements This work was partially supported by NSERC discovery grant 8136 -2013 and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais.  ... 
arXiv:1506.07952v1 fatcat:su776uqt7jelxfeoagudfnp26e

Locating a target with an agent guided by unreliable local advice

Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse
2010 Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10  
We study the problem of finding a destination node t by a mobile agent in an unreliable network having the structure of an unweighted graph, in a model first proposed by Hanusse et al. [21, 20] .  ...  This paper focuses on strategies which efficiently solve the search problem in scenarios in which, at each node, the agent may only choose between following the local advice, or randomly selecting an incident  ...  The problem is then to deal with the potentially incorrect information and to find the desired item.  ... 
doi:10.1145/1835698.1835781 dblp:conf/podc/HanusseIKN10 fatcat:tgcmcshm4fgcfeep6itpjvri5y

Detecting Inconsistent Health Information by Leveraging Abstract Meaning Representation Graphs [article]

Joseph Gatto, Sarah M. Preum
2022 Zenodo  
We explore the applicability of a state-of-the-art language model, namely BERT, to solve this problem.  ...  However, many individuals receive medical advice that is accurate in the context of one diagnosis yet conflicting or inconsistent with each other, e.g., people suffering from diabetes and hypertension  ...  One potential solution to this problem is the rephrasing of duplicate pieces of advice.  ... 
doi:10.5281/zenodo.6383138 fatcat:tu7n6rgombh6pftcbxsoeec3ia

Foreword

Cyril Gavoille, Boaz Patt-Shamir, Christian Scheideler
2010 Theory of Computing Systems  
on the distributed complexity and local approximability of the Capacitated Dominating Set Problem. • "Strong-Diameter Decompositions of Minor Free Graphs" provides the first sparse covers and probabilistic  ...  partitions for graphs excluding a fixed minor that have strong diameter bounds in the sense that each set of the cover resp. partition has a small diameter as an induced subgraph. • "Approximation Algorithms  ...  cache-obliviously for both shared and distributed caches for sufficiently large inputs. • "Local MST Computation with Short Advice" explores the distributed computing with advice paradigm for the local  ... 
doi:10.1007/s00224-010-9284-5 fatcat:twbodq7n7ngkvmxxppywh2pmny

Interactive Reinforcement Learning for Feature Selection with Decision Tree in the Loop [article]

Wei Fan, Kunpeng Liu, Hao Liu, Yong Ge, Hui Xiong, Yanjie Fu
2020 arXiv   pre-print
We study the problem of balancing effectiveness and efficiency in automated feature selection.  ...  We propose a new embedding method capable of empowering graph convolutional network to jointly learn state representation from both the graph and the tree.  ...  Advice. Trainers give multiple agents advice on their actions; gents will follow the advice to take actions. Definition 2.7. Problem Statement.  ... 
arXiv:2010.02506v1 fatcat:4efavsdjmzdrfbj4fe3zp4an6e

Local MST computation with short advice

Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
2007 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07  
That is, by only giving a constant number of bits of advice to each node, one can decrease exponentially the distributed computation time of MST in arbitrary graph, compared to algorithms dealing with  ...  is at most m bits, and (2) the problem P can be solved distributively in at most t rounds using the advices as inputs.  ...  of advice, the broadcast and wake-up problems require both Θ(E) messages in E-edge graphs).  ... 
doi:10.1145/1248377.1248402 dblp:conf/spaa/FraigniaudKL07 fatcat:2po4tw74e5emlj7ibhpkbrvc74
« Previous Showing results 1 — 15 out of 68,074 results