A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
An Experimental Study of ILP Formulations for the Longest Induced Path Problem
[article]
2020
arXiv
pre-print
Preserved Fulltext
Other Versions
Given a graph G=(V,E), the longest induced path problem asks for a maximum cardinality node subset W⊆ V such that the graph induced by W is a path. ...
We propose novel integer linear programming (ILP) formulations for the problem and discuss efficient implementations thereof. ...
If G[W ] is a path, it is called an induced path. The length of a longest induced path is also referred to as the induced detour number which was introduced more than 30 years ago [8] . ...
arXiv:2002.07012v2
fatcat:efvctllfrbasthxt63xfolqcwe
Computational methods for finding long simple cycles in complex networks
2017
Knowledge-Based Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The first method is an exact approach based on our own integer linear programming formulation of the problem and a data mining pipeline. ...
Our experimental results are presented for social network samples, graphs studied in the network science field, graphs from DIMACS series, and proteinprotein interaction networks. ...
The longest cycle problem is also often linked with the longest path problem, for which efficient algorithms [42] and approximations [25] have been studied. ...
doi:10.1016/j.knosys.2017.03.022
fatcat:gt3dns3a3zgs3o2xwjnf2z2tsy
In-Place FPGA Retiming for Mitigation of Variational Single-Event Transient Faults
2011
IEEE Transactions on Circuits and Systems Part 1: Regular Papers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The SaR problem is formulated as an integer linear programming (ILP) problem and solved efficiently by a progressive ILP approach. ...
To the best of our knowledge, this paper is the first in-depth study on FPGA retiming for SET mitigation. ...
The SaR problem is formulated as an integer linear programming (ILP) problem and solved efficiently by a progressive ILP approach. ...
doi:10.1109/tcsi.2010.2094370
fatcat:mgl6tyxzcfa57h3upkz6tkpjue
The resource-constrained modulo scheduling problem: an experimental study
2012
Computational optimization and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Then the obtained retiming is used to build an Integer Linear Programming formulation of reduced size, which allows to solve it exactly. ...
Experimental results show that a lot more problems are solved with this new approach. The gap to the optimal solution is really small (0 or 1%) on all the tested problem instances. ...
Acknowledgement The authors wish to warmly thank Benoit Dupont de Dinechin for making the ST200 instances available and also for this helpful advices on modulo scheduling. ...
doi:10.1007/s10589-012-9499-2
fatcat:qdm65soz5zbbzbnd2pxmqhg5ly
Antilope—A Lagrangian Relaxation Approach to the de novo Peptide Sequencing Problem
2012
IEEE/ACM Transactions on Computational Biology & Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Antilope combines Lagrangian relaxation for solving an integer linear programming formulation with an adaptation of Yen's k shortest paths algorithm. ...
Especially de novo sequencing, the identification of a peptide from its spectrum alone, is still a challenge even for state-of-the-art algorithmic approaches. ...
Andreotti is the corresponding author. K. Reinert and G.W. Klau are shared last authors. ...
doi:10.1109/tcbb.2011.59
pmid:21464512
fatcat:apmchax4kjcc7iglarzuccu4aq
An Interconnect-Centric Approach to Cyclic Shifter Design Using Fanout Splitting and Cell Order Optimization
2007
2007 Asia and South Pacific Design Automation Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then perform cell order optimization to further improve the delay, and formulate it as an integer linear programming problem. ...
The use of demultiplexers has a two-fold effect; it cuts the accumulated wire load on the critical path from O(N log 2 (N )) to O(N ), and reduces the switching probabilities on the inter-stage long wires ...
We formulate the optimization as an Integer Linear Programming (ILP) problem and solve it using commercial ILP solver CPLEX 9.1. ...
doi:10.1109/aspdac.2007.358054
dblp:conf/aspdac/ZhuZCH07
fatcat:brpl6httdrfbhk6prt7fs62bi4
Static probabilistic worst case execution time estimation for architectures with faulty instruction caches
2013
Proceedings of the 21st International conference on Real-Time Networks and Systems - RTNS '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The proposed method, because it relies on static analysis, is guaranteed to identify the longest program path, its probabilistic nature only stemming from the presence of faults. ...
The method is computationally tractable because it does not require an exhaustive enumeration of the possible locations of faulty cache blocks. ...
Acknowledgments The authors would like to thank Benjamin Lesage, Bastien Pasdeloup and Jaume Abella for their fruitful comments on earlier versions of this paper. ...
doi:10.1145/2516821.2516842
dblp:conf/rtns/HardyP13
fatcat:jj2asaiumvbc3mupfhpqcckaz4
A scalable approach for survivable virtual topology routing in optical WDM networks
2007
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We present an improved integer linear programming (ILP) formulation for computing the survivable routing of a virtual topology graph. ...
In this work we study the problem of survivable virtual topology routing under single node/SRLG (Shared Risk Link Group) failure model. ...
Authors presented the necessary and sufficient conditions for survivable routing and provided an ILP formulation. In this work we study the survivable routing problem under SRLG/node failures. ...
doi:10.1109/jsac-ocn.2007.020605
fatcat:covrqgvxenegzpinrrqj3xzlka
A formulation for a hop constrained survivable network design problem
2017
Yugoslav Journal of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This article presents an integer linear model for the hop constrained node survivable network design problem. ...
The proposed model allows setting different values of parameters for constraints between each pair of terminal nodes, including hop length and number of node disjoint paths constraints. ...
AN ILP FORMULATION FOR THE HCSNDP The proposed formulation is a variant of the existing models known as "Hop-indexed formulation", presented by Gouveia et al. ...
doi:10.2298/yjor160512004f
fatcat:4oy5fqxnbfd2rapkzjhk25asba
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes
2020
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For the restricted version, we build an ILP model and design a fast algorithm by using the techniques of augmenting paths and splitting nodes. ...
It comes out the problem of finding k link-disjoint paths between a given pair of source and sink in a network such that the number of common nodes shared by at least two paths is bounded by a constant ...
Acknowledgments The work is supported by the National Natural Science Foundation of China, under grants 61972070 and 61802049. ...
doi:10.1609/aaai.v34i01.5441
fatcat:4ilmj3lgvfbtvdgnryhmpa2qkq
Area-efficient instruction set synthesis for reconfigurable system-on-chip designs
2004
Proceedings of the 41st annual conference on Design automation - DAC '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our approach is based on the classic problems of finding the longest common subsequence and substring of two (or more) sequences. ...
This study presents an efficient heuristic which transforms a set of custom instructions into a single hardware datapath on which they can execute. ...
The problem of determining the longest common subsequence (LCSeq) of a set of sequences has an O(mn/logm) solution [13] . ...
doi:10.1145/996566.996679
dblp:conf/dac/BriskKS04
fatcat:bvt4czqnsncudgog26zhvtm66q
A lower bound for the job insertion problem
2003
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This note deals with the job insertion problem in job-shop scheduling: Given a feasible schedule of n jobs and a new job which is not scheduled, the problem is to ÿnd a feasible insertion of the new job ...
After the analysis of the polytope of feasible insertions, a polynomial time procedure is proposed to solve the relaxed problem. ...
The research reported in this paper was partly supported by the Swiss Commission for Technology and Innovation (CTI) grant no. 4173 while both authors were a liated with the Department of Mathematics of ...
doi:10.1016/s0166-218x(02)00502-4
fatcat:x6qdcs6hcndsjcfnwfh3txg2pe
Attack-Aware Dedicated Path Protection in Optical Networks
2016
Journal of Lightwave Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We provide a two-step ILP formulation for the routing and wavelength assignment of the working and backup paths, as well as a heuristic for larger problem instances. ...
To enhance the existing survivability approaches, we utilize the concept of an attack group (AG) which incorporates these characteristics to identify connections which can simultaneously be affected by ...
In this work, we focus on 1:1 dedicated path protection. An ILP formulation for the dedicated path protection problem with the objective to minimize the total used capacity was proposed in [16] . ...
doi:10.1109/jlt.2015.2509161
fatcat:nqbidgsecbbnlb4egerjo7cyqa
Escaped Boundary Pins Routing for High-Speed Boards
2013
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our results show that we can utilize routing resources very carefully, and can account for the resemblance of nets in the presence of the obstacles. Our approach is workable for board buses as well. ...
Our approach has different features compared with the conventional shortest-path-based routing paradigm. ...
In this section, we propose an ILP formulation to adjust the net length. ...
doi:10.1109/tcad.2012.2221714
fatcat:5cvx5oon2zaotpn7nbcb75rgwm
Using Answer Set Programming to Integrate RNA Expression with Signalling Pathway Information to Infer How Mutations Affect Ageing
2012
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also develop a method for inferring the largest common sub-paths within each of our signalling predictions. ...
By formulating the problem as a logic-based theory in a qualitative fashion, we are able to use the efficient search facilities of Answer Set Programming, allowing us to explore larger pathways, combine ...
Acknowledgments We thank Alexander Artikis and Nikos Katzouris for useful discussions on Answer Set Programming. We thank Julio Saez-Rodriguez for feedback on this work.
Author Contributions ...
doi:10.1371/journal.pone.0050881
pmid:23251396
pmcid:PMC3519537
fatcat:y3jvsjnyh5flzlcpakatnfla2a
« Previous
Showing results 1 — 15 out of 453 results