Filters








102 Hits in 4.9 sec

DFS is Unsparsable and Lookahead Can Help in Maximal Matching

Kitti Gelle, Szabolcs Iván
2018 Acta Cybernetica  
In this paper we study two problems in the context of fully dynamic graph algorithms that is, when we have to handle updates (insertions and removals of edges), and answer queries regarding the current  ...  In the first part we show that there are dense (directed) graphs having no nontrivial strong certificates for maintaining a depth-first search tree, hence the so-called sparsification technique cannot  ...  Using lookahead (observe that t < m) we collect all the edges involved in q (either by a +(u, v) or a −(u, v) update operation) into a graph G . 2. We construct the graph G = G − G . 3.  ... 
doi:10.14232/actacyb.23.3.2018.10 fatcat:hnbtabpsh5f67hvveyizpas4ze

Page 1278 of Mathematical Reviews Vol. , Issue 99b [page]

1991 Mathematical Reviews  
[Wilson, Randall H.] (1-SAND-IRB; Albuquerque, NM) ; On certificates and lookahead in dynamic graph problems. (English summary) Algorithmica 21 (1998), no. 4, 377-394.  ...  “In many applications of dynamic (di)graph problems, a cer- tain form of lookahead is available.  ... 

Stochastic Search for a Parametric Cost Function Approximation: Energy storage with rolling forecasts [article]

Saeed Ghadimi, Warren B. Powell
2022 arXiv   pre-print
Our approach shifts the focus from modeling the uncertainty in a lookahead model to accurate simulations in a stochastic base model.  ...  We develop a robust policy for making energy storage decisions by creating a parametrically modified lookahead model, where the parameters are tuned in the stochastic base model.  ...  ., t + H} and solve a stochastic dynamic program. With this strategy, the forecast becomes a latent variable in the lookahead model.  ... 
arXiv:2204.07317v1 fatcat:ob6l4ry6mbapfolwt33nommj2m

Fast Lower and Upper Estimates for the Price of Constrained Multiple Exercise American Options by Single Pass Lookahead Search and Nearest-Neighbor Martingale [article]

Nicolas Essis-Breton, Patrice Gaillardetz
2020 arXiv   pre-print
Typical options in this class are swing options with volume and timing constraints, and passport options with multiple lookback rights.  ...  The lower estimate algorithm uses the artificial intelligence method of lookahead search.  ...  Implementation To run SPLS and NNM, we use a 100 processors machine with 100 GB RAM in the Google Cloud (2020), and we use the linear programming solver Gurobi (2020).  ... 
arXiv:2002.11258v1 fatcat:q7fv5mkq6nhq7hxsxorx5yb6dm

Efficient reduction of nondeterministic automata with application to language inclusion testing [article]

Lorenzo Clemente, Richard Mayr
2018 arXiv   pre-print
This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories.  ...  These techniques use criteria based on combinations of backward and forward trace inclusions and simulation relations.  ...  We acknowledge the anonymous reviewers for their extensive comments on earlier drafts of this article.  ... 
arXiv:1711.09946v3 fatcat:3fgofy65d5cgbnklzcstmnc2zi

Generating customized verifiers for automatically generated code

Ewen Denney, Bernd Fischer
2008 Proceedings of the 7th international conference on Generative programming and component engineering - GPCE '08  
It also takes care of some more routine aspects of formulating patterns and schemas, in particular handling of irrelevant program fragments and irrelevant variance in the program structure, which reduces  ...  We have previously developed a generic annotation inference algorithm that weaves in all annotations required to certify safety properties for automatically generated code.  ...  Acknowledgments This paper is based on work supported by NASA under award NCC2-1426. and NNA07BB97C. Fischer is supported by the EPSRC grant EP/F052669/1.  ... 
doi:10.1145/1449913.1449926 dblp:conf/gpce/DenneyF08 fatcat:hu3y2xmkovhc5flhygmkxokody

Binary-Level Testing of Embedded Programs

Sebastien Bardin, Philippe Baufreton, Nicolas Cornuet, Philippe Herrmann, Sebastien Labbe
2013 2013 13th International Conference on Quality Software  
on four real-life case-studies, describing the use of OSMOSE in different situations:  ...  Dynamic Symbolic Execution (DSE) is a powerful approach to automatic test data generation. It has been heavily used in recent years for finding bugs in desktop programs.  ...  Yet, in presence of dynamic jumps the recovered CFG is only partial, posing two problems: (1) the coverage measure cannot be trusted (which is problematic for critical systems), and (2) the precision of  ... 
doi:10.1109/qsic.2013.49 dblp:conf/qsic/BardinBCHL13 fatcat:l7zog6awfjfjpguvsto3z2agvu

Streaming Verification of Graph Properties [article]

Amirali Abdullah, Samira Daruki, Chitradeep Dutta Roy, Suresh Venkatasubramanian
2016 arXiv   pre-print
In particular, these are the first efficient results for weighted matchings and for metric TSP in any streaming verification model.  ...  SIPs are particularly interesting for problems that are hard to solve (or even approximate) well in a streaming setting.  ...  In all our results, we consider the input in the dynamic streaming model, where graph edges are presented in arbitrary order in a stream and we allow both deletion and insertion of edges.  ... 
arXiv:1602.08162v2 fatcat:blq4gmv2qbgdxp7eeecgvveh2a

Dynamic spectrum allocation under cognitive cell network for M2M applications

Qing Wang, Ting He, Kwang-Cheng Chen, Junsong Wang, Bongjun Ko, Yonghua Lin, Kang-won Lee
2012 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)  
Based on the analysis, we propose a novel mechanism for dynamic spectrum allocation in a cognitive radio environment for SmartGrid applications using OFDMA technology and give some evaluations based on  ...  The spectrum allocation we proposed can be divided into two stages: network entry stage based on initial sensing and dynamic interference avoidance stage based on periodical sensing.  ...  Approximability of SCA: SCA is NPcomplete because we can easily reduce the decision problem of graph coloring to SCA.  ... 
doi:10.1109/acssc.2012.6489076 dblp:conf/acssc/WangHCWKLL12 fatcat:konxfiqwsrfbfaetcm72bld7hm

Search in Imperfect Information Games [article]

Martin Schmid
2021 arXiv   pre-print
Turing's chess algorithm from 1950 was able to think two moves ahead, and Shannon's work on chess from 1950 includes an extensive section on evaluation functions to be used within a search.  ...  The combination of decision-time search and value functions has been present in the remarkable milestones where computers bested their human counterparts in long standing challenging games – DeepBlue for  ...  The resulting policy can then be thought of as a small certificate and one can verify the validity of such a certificate in time linear in the size of the certificate (in contrast to the size of the full  ... 
arXiv:2111.05884v1 fatcat:lrwo6qdbmzgyri64625zd3vdjm

Power – Performance Optimization for Custom Digital Circuits

Radu Zlatanovici, Borivoje Nikolić
2006 Journal of Low Power Electronics  
The optimization examples are presented on 54-bit carry-Iookahead adders.  ...  This paper presents a modular optimization framework for custom digital circuits in the power performance space.  ...  Acknowledgment: This work was supported in part hy NSF grant ECS-0238572.  ... 
doi:10.1166/jolpe.2006.013 fatcat:gvs3nbr3yzeclcqzl4wgcmuwma

Power – Performance Optimization for Custom Digital Circuits [chapter]

Radu Zlatanovici, Borivoje Nikolić
2005 Lecture Notes in Computer Science  
The optimization examples are presented on 54-bit carry-Iookahead adders.  ...  This paper presents a modular optimization framework for custom digital circuits in the power performance space.  ...  Acknowledgment: This work was supported in part hy NSF grant ECS-0238572.  ... 
doi:10.1007/11556930_42 fatcat:uvmmoywhafgipomofnsfjz643i

Matching Dynamics with Constraints [article]

Martin Hoefer, Lisa Wagner
2014 arXiv   pre-print
However, depending on the constraints and the current state of the game, not all possible partners are available for matching at all times.  ...  For the problem of reaching a given stable state, we show NP-hardness in almost all considered classes of matching games.  ...  Acknowledgment Part of this research was done at the Institute for Mathematical Sciences of NUS Singapore, and at NTU Singapore.  ... 
arXiv:1409.4304v1 fatcat:tm7pbr2tgvhbzgr4cxdmcdliae

Matching Dynamics with Constraints [chapter]

Martin Hoefer, Lisa Wagner
2014 Lecture Notes in Computer Science  
For the problem of reaching a given stable state, we show NP-hardness in almost all considered classes of matching games. ⋆ Supported by DFG Cluster of Excellence MMCI and grant Ho 3831/3-1.  ...  However, depending on the constraints and the current state of the game, not all possible partners are available for matching at all times.  ...  Acknowledgment Part of this research was done at the Institute for Mathematical Sciences of NUS Singapore, and at NTU Singapore.  ... 
doi:10.1007/978-3-319-13129-0_12 fatcat:7gvaiuzz75f2xc4vcyqkjcwshq

Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method

Marijn J.H. Heule, Oliver Kullmann, Victor W. Marek
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
We present this and the underlying paradigm Cube-and-Conquer, a powerful general method to solve big SAT problems, based on integrating the "old" and "new" methods of SAT solving.  ...  A recent success of SAT solving has been the solution of the boolean Pythagorean Triples problem [Heule et al., 2016], delivering the largest proof yet, of 200 terabytes in size.  ...  Furthermore no "overview heuristics" are used (as for look-ahead), but a dynamic heuristics based on usage of variables in recently learned clauses.  ... 
doi:10.24963/ijcai.2017/683 dblp:conf/ijcai/HeuleKM17 fatcat:sab7hccyanhcngia42ntarvlh4
« Previous Showing results 1 — 15 out of 102 results