Filters








1,386 Hits in 2.6 sec

CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints [article]

Anselm Paulus and Michal Rolínek and Vít Musil and Brandon Amos and Georg Martius
<span title="2022-04-11">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We demonstrate the potential of such layers with an extensive performance analysis on synthetic data and with a demonstration on a competitive computer vision keypoint matching benchmark.  ...  On the algorithmic side, many NP-hard problems can be expressed as integer programs, in which the constraints play the role of their "combinatorial specification."  ...  Acknowledgements Georg Martius is a member of the Machine Learning Cluster of Excellence, funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.02343v2">arXiv:2105.02343v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c7bc2jcpanbl3eu4nq6obhetia">fatcat:c7bc2jcpanbl3eu4nq6obhetia</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220519023124/https://arxiv.org/pdf/2105.02343v2.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/99/58/995884b64f12fac87644d75c22ab045a21ff91b8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.02343v2" 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>

Optimal CNN–Hopfield Network for Pattern Recognition Based on a Genetic Algorithm

Fekhr Eddine Keddous, Amir Nakib
<span title="2021-12-27">2021</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/63zsvf7vxzfznojpqgfvpyk2lu" style="color: black;">Algorithms</a> </i> &nbsp;
To optimize this step, the knapsack problem formulation is proposed, and a genetic algorithm (GA) is used solve it.  ...  Then, to deal with the limitation of the storage capacity of the HNN, the proposed work uses multiple HNNs.  ...  • Inference acceleration of a CNN-based architecture. • Formulation of the optimization of the architecture as a knapsack problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a15010011">doi:10.3390/a15010011</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jpu5f5evsjgmpcylwudgdpsnvq">fatcat:jpu5f5evsjgmpcylwudgdpsnvq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220501105654/https://mdpi-res.com/d_attachment/algorithms/algorithms-15-00011/article_deploy/algorithms-15-00011-v2.pdf?version=1640738388" 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/8e/ae/8eae5e5de5e71f236cdd0bba3a508d790c9b2b59.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a15010011"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Automatic Feature Point Selection through Hybrid Metaheauristics based on Tabu Search and Memetic Algorithm for Augmented Reality

Takeshi Matsui, Yuichi Katagiri, Hideki Katagiri, Kosuke Kato
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cx3f4s3qmfe6bg4qvuy2cxezyu" style="color: black;">Procedia Computer Science</a> </i> &nbsp;
for the formulated feature point selection problem.  ...  However, under active use of AR applications on mobile devices, we need to take account of processing speed and precision due to mobile processors.  ...  We extract feature points for the original image and generate 100 projection-converted images. Then, we match with the original image and 100 projection-converted images.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2015.08.160">doi:10.1016/j.procs.2015.08.160</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oavhqcfhybhrxkb7xt3xw5rage">fatcat:oavhqcfhybhrxkb7xt3xw5rage</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190414135334/https://core.ac.uk/download/pdf/81162372.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/b3/9b/b39b6f299a4635cc682fc13c931d0d5ee703def0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2015.08.160"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Computation core binding in GTM mapping on reconfigurable computers

Xuejun Liang
<span title="">2006</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rk4tzdw5nzcqfolehh5kubgisy" style="color: black;">Proceedings of the 44th annual southeast regional conference on - ACM-SE 44</a> </i> &nbsp;
A combinatorial optimization problem, where the cost function is the FPGA computation time and the constraint is the FPGA board resource, is formulated as a step in mapping generalized template matching  ...  Experimental results are also given to show the efficiency of proposed algorithms.  ...  The generalized template matching (GTM) operations [1] include image-processing algorithms for template matching, 2D digital filtering, morphologic operations, motion estimation, and so on.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1185448.1185625">doi:10.1145/1185448.1185625</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ACMse/Liang06.html">dblp:conf/ACMse/Liang06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/65m2glnec5hstalshn7jvzfroa">fatcat:65m2glnec5hstalshn7jvzfroa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060907032526/http://ccaix.jsums.edu/~xuejun.liang/publications/ACMSE06poster.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/89/ac/89ac252a3e8a2edd25e3d6abc6e0d557180b8bef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1185448.1185625"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Unified Framework of Constrained Robust Submodular Optimization with Applications [article]

Rishabh Iyer
<span title="2021-03-18">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We do this under a broad range of combinatorial constraints including cardinality, knapsack, matroid as well as graph-based constraints such as cuts, paths, matchings and trees.  ...  Finally, we empirically demonstrate the utility of our algorithms on synthetic data, and real-world applications of robust cooperative matchings for image correspondence, robust data subset selection for  ...  Robust Co-operative Matchings: The problem of matching key-points in images, also called image correspondence, is an important problem in computer vision (Ogale & Aloimonos, 2005 ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.06393v2">arXiv:1906.06393v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y47344ygonawviwtcdfopjldj4">fatcat:y47344ygonawviwtcdfopjldj4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210329125418/https://arxiv.org/pdf/1906.06393v2.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/2a/09/2a0964f598e456f9bdec620aac60463a17dbfe9d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.06393v2" 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>

Knapsack Pruning with Inner Distillation [article]

Yonathan Aflalo and Asaf Noy and Ming Lin and Itamar Friedman and Lihi Zelnik
<span title="2020-06-03">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
To enable this approach, we formulate the network pruning as a Knapsack Problem which optimizes the trade-off between the importance of neurons and their associated computational cost.  ...  Then we prune the network channels while maintaining the high-level structure of the network.  ...  (images for example).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2002.08258v3">arXiv:2002.08258v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uct7jlobbvciznrykao2fpgt6a">fatcat:uct7jlobbvciznrykao2fpgt6a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200912155412/https://arxiv.org/pdf/2002.08258v3.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/3d/37/3d371b00e456e0ee2c414611177f7c855db7c223.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2002.08258v3" 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>

Robust Submodular Minimization with Applications to Cooperative Modeling [article]

Rishabh Iyer
<span title="2020-01-25">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
, knapsack, matroid as well as graph-based constraints such as cuts, paths, matchings, and trees.  ...  Constrained Submodular Minimization arises in several applications such as co-operative cuts in image segmentation, co-operative matchings in image correspondence, etc.  ...  A number of constraints including matchings, knapsacks, s-t paths and spanning trees satisfy this [45] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.09360v1">arXiv:2001.09360v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/og7rzbr7zvazji6pd342nd3zdu">fatcat:og7rzbr7zvazji6pd342nd3zdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321021603/https://arxiv.org/pdf/2001.09360v1.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] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.09360v1" 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>

Container Placement and Migration in Edge Computing: Concept and Scheduling Models

Omogbai Oleghe
<span title="">2021</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q7qi7j4ckfac7ehf3mjbso4hne" style="color: black;">IEEE Access</a> </i> &nbsp;
The authors in [11] used Tabu-search to solve their knapsack problem formulation for the optimal placement of containerized data blocks in edge computing.  ...  A perfect matching is where all tasks are mapped. A maximum matching attempts to map the largest number of tasks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2021.3077550">doi:10.1109/access.2021.3077550</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oy5zqgh2azbrdgfmkyuec7zor4">fatcat:oy5zqgh2azbrdgfmkyuec7zor4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210718021557/https://ieeexplore.ieee.org/ielx7/6287639/6514899/09422781.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/75/f475141d2af86af856fc617e3cce05e19792d03d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2021.3077550"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> ieee.com </button> </a>

The trouble with the second quantifier

Gerhard J. Woeginger
<span title="2021-04-26">2021</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/a7azxtgamnavvcktn5y7xrjas4" style="color: black;">4OR</a> </i> &nbsp;
AbstractWe survey optimization problems that allow natural simple formulations with one existential and one universal quantifier.  ...  We summarize the theoretical background from computational complexity theory, and we present a multitude of illustrating examples.  ...  textbooks we usually find the existentially quantified NP-formulation of Bipartite Matching ("there exists a perfect matching").  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10288-021-00477-y">doi:10.1007/s10288-021-00477-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h4ep6yoqvrberjkfkds3wfmi5m">fatcat:h4ep6yoqvrberjkfkds3wfmi5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210718082642/https://link.springer.com/content/pdf/10.1007/s10288-021-00477-y.pdf?error=cookies_not_supported&amp;code=54616a3d-d51f-4096-8bff-42997186f925" 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/93/03/9303e8747eac6ccdfd9f8b532f7baed1a7383fe8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10288-021-00477-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>

Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization

Jochen Gorski, Kathrin Klamroth, Stefan Ruzika
<span title="2011-04-22">2011</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ynhjdrvpsnbidmoniqokzz5ota" style="color: black;">Journal of Optimization Theory and Applications</a> </i> &nbsp;
problems (and even several special cases of knapsack problems) and linear assignment problems.  ...  Different concepts of connectedness are discussed in a formal setting, and numerical tests are performed for different variants of the knapsack problem to analyze the likelihood with which non-connected  ...  Y := f (X) denotes the image of the feasible set in the objective space.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10957-011-9849-8">doi:10.1007/s10957-011-9849-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r264co7uezbj5kwm327jjfnotu">fatcat:r264co7uezbj5kwm327jjfnotu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921202615/https://kluedo.ub.uni-kl.de/frontdoor/deliver/index/docId/1815/file/nr102.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/01/3e/013ee823e3e3bfec5d56d7fde6f88e727184c5ef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10957-011-9849-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Multimodal Recommender System for Large-scale Assortment Generation in E-commerce [article]

Murium Iqbal, Adair Kovac, Kamelia Aryafar
<span title="2018-06-28">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The first system aims to maximize the visual-based style compatibility of the entire selection by making use of transfer learning and topic modeling.  ...  In this paper, we propose two visually-aware recommender systems that can automatically curate an assortment of living room furniture around a couple of pre-selected seed pieces for the room.  ...  We also review our formulation of assortment generation as a 0-1 quadratic knapsack problem and our greedy optimization for building assortments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.11226v1">arXiv:1806.11226v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2cnak27q7ndnjirvhso5m5cqpa">fatcat:2cnak27q7ndnjirvhso5m5cqpa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928190821/https://arxiv.org/pdf/1806.11226v1.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/28/96/2896150fe02974b555f6598c02e185dc538973ef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.11226v1" 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 Genetic Algorithm-based Approach to Dynamic Architectural Deployment [chapter]

Dongsun Kim, Sooyong Park
<span title="2010-02-01">2010</span> <i title="InTech"> Human-Robot Interaction </i> &nbsp;
The deployment of components into computing units can influence the performance of tasks.  ...  Different instances of component deployment show different performance results because the resources of the computing units are different.  ...  Therefore, this problem is formulated as a multidimensional knapsack problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/8132">doi:10.5772/8132</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3vby76flize5zc5qoafjr6l2uy">fatcat:3vby76flize5zc5qoafjr6l2uy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726234511/https://api.intechopen.com/chapter/pdf-download/8621" 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/5c/0a/5c0aca2687480a7bbb292ffa84c40d06b6026d0c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/8132"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Attention-based video summarisation in rushes collection

Reede Ren, Punitha Puttu Swamy, Joemon M. Jose, Jana Urban
<span title="">2007</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lahlxihmo5fhzpexw7rundu24u" style="color: black;">Proceedings of the international workshop on TRECVID video summarization - TVS &#39;07</a> </i> &nbsp;
This paper presents the framework of a general video summarisation system on the rushes collection, which formalises the summarisation process as an 0 − 1 Knapsack optimisation problem.  ...  Content selection weights the importance of video segments by an attention model.  ...  The research leading to this paper was partially supported by European Commission under contracts: Knowledge Space of semantic inference for automatic annotation and retrieval of multimedia content(K-Space  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1290031.1290048">doi:10.1145/1290031.1290048</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/mm/RenSJU07.html">dblp:conf/mm/RenSJU07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ibk24vcp6rhtth4rxyc3d7jdsm">fatcat:ibk24vcp6rhtth4rxyc3d7jdsm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110104072916/http://www.dcs.gla.ac.uk/~reede/pdfs/tvs2007.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/86/aa/86aa64a66132738d638ea58a2ca8b5f9456e764d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1290031.1290048"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Discrete relaxations of combinatorial programs

Ralf Borndörfer, Robert Weismantel
<span title="">2001</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;
This paper investigates a technique of building up discrete relaxations of combinatorial optimization problems.  ...  We show that knapsack and set packing relaxations give rise to combinatorial cutting planes in a simple and straightforward way. The constructions are algorithmic. ?  ...  The image (P) of a polyhedron P under the scheme is called the -aggregate or, if there is no danger of confusion, simply the aggregate of P.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(00)00307-3">doi:10.1016/s0166-218x(00)00307-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vg3bc6nadfdynmxn5zhous477u">fatcat:vg3bc6nadfdynmxn5zhous477u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170929112626/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/79b/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDE2NjIxOHgwMDAwMzA3Mw%3D%3D.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/d8/6c/d86cdc477a2f6c26b1d8861f64e58147a788ece5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(00)00307-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Optimizing QoS for Multimedia Services in Next Generation Network Based on ACO Algorithm

Dac-Nhuong Le
<span title="2013-09-01">2013</span> <i title="MECS Publisher"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/arieir5stvdafmqjc5uirmt37i" style="color: black;">International Journal of Information Technology and Computer Science</a> </i> &nbsp;
The negotiation and dynamic adaptation of Qo S is currently considered to be one of the key features of the NGN concept.  ...  In Next Generation Netwo rk (NGN), the backbone of the overall network architecture will be IP network, supporting different access network technologies and types of traffics.  ...  Model of OQMS Problem The optimal QoS for mu ltimed ia services (OQM S) problem can be formulated as a multi-choice mu ltidimension 0-1 knapsack problem (MMKP), for which I introduce the following notation  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5815/ijitcs.2013.10.04">doi:10.5815/ijitcs.2013.10.04</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g5zex3wrifgn5cuw5q7bc6f2ve">fatcat:g5zex3wrifgn5cuw5q7bc6f2ve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812231815/http://www.mecs-press.org/ijitcs/ijitcs-v5-n10/IJITCS-V5-N10-4.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/c1/3e/c13e4235ade96ed4b56e7ac3e40371f6484b646f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5815/ijitcs.2013.10.04"> <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>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,386 results