Filters








11,491 Hits in 2.7 sec

Exact Exploration and Hanging Algorithms [chapter]

Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2010 Lecture Notes in Computer Science  
Emulating a step of the given algorithm, the ASM, produced in the proof of the new representation theorem, explores exactly the part of the state explored by the algorithm.  ...  Now we allow state functions, including equality, to be partial so that a function call may cause the algorithm as well as the ASM to hang.  ...  We thank Olivier Bournez for his comments on an early draft and Ulrich Kohlenbach for information on computable reals.  ... 
doi:10.1007/978-3-642-15205-4_14 fatcat:fl36qiw5crfkxjfitcqis645bm

UNIQUENESS, INTRACTABILITY AND EXACT ALGORITHMS: REFLECTIONS ON LEVEL-K PHYLOGENETIC NETWORKS

LEO VAN IERSEL, STEVEN KELK, MATTHIAS MNICH
2009 Journal of Bioinformatics and Computational Biology  
As a response to this intractability, we give an exact algorithm for constructing level-1 networks consistent with a maximum number of input triplets.  ...  Phylogenetic networks provide a way to describe and visualize evolutionary histories that have undergone so-called reticulate evolutionary events such as recombination, hybridization or horizontal gene  ...  Let a 1 and a 2 be the two cut-arcs leaving the root Algorithm 1 . 1 Exact Algorithm for MaxCL-1 1. for each ∈ L do 2.  ... 
doi:10.1142/s0219720009004308 pmid:19634194 fatcat:hynoi6alkjg6nendvnzbi4yeg4

Multi-population Genetic Algorithm for Cardinality Constrained Portfolio Selection Problems [chapter]

Nasser R. Sabar, Ayad Turky, Mark Leenders, Andy Song
2018 Lecture Notes in Computer Science  
To solve PS more effectively and more efficiently, this paper introduces a Multi-population Genetic Algorithm (MPGA) methodology.  ...  The proposed MPGA decomposes a large population into multiple populations to explore and exploit the search space simultaneously.  ...  In contrast to exact methods, heuristic and meta-heuristic approaches search for near-best solutions.  ... 
doi:10.1007/978-3-319-93698-7_10 fatcat:vs7uhm5ngzeodjy5d3vitmolum

A note on programs performing kriging with nonnegative weights

Christina Herzfeld
1989 Mathematical Geology  
Mathematically the question is considered as a case of quadratic programming, Hints concerning computational approaches and software are given.  ...  For instance, in resource exploration, geologic layers should always have nonnegative thicknesses and hanging and foot walls must not cross each other.  ...  To avoid the computational effort of quadratic optimization, Barnes and Johnson (1984) use the latter property of the active set concept and develop a fast algorithm that first solves the ordinary point  ... 
doi:10.1007/bf00893699 fatcat:xorwmbhk75eaznis4dqighn7fu

Theatre of Restless Automata [article]

Vicky Isley, Paul Smith
2007 Computational Aesthetics in Graphics  
Our enthusiasm for scientific modelling techniques and fascination with natural systems has inspired us to develop computational artworks over the last six years that explore the aesthetics of emergence  ...  ongoing research into artificial-life and digital biology.  ...  This year residency explored computation and algorithm away from the computer in an attempt to unravel the mysteries of programming as a creative form of expression.  ... 
doi:10.2312/compaesth/compaesth07/163-166 fatcat:sfqu3e7kxrfqfjcyux67n5osfm

Shortest paths on dynamic graphs

Giacomo Nannicini, Leo Liberti
2008 International Transactions in Operational Research  
Acknowledgements We are grateful to Maria Grazia Scutellà for providing useful suggestions and helpful discussions that increased the quality of this survey.  ...  Dijkstra [12] observed that if the cost function c is non-negative and v is an explored vertex with the smallest distance label, then d(v) is exact; so, we refer to the labeling method with the minimum  ...  The method starts by setting d(s) = 0 and S(s) = explored; while there are labeled (i.e. explored) vertices, the method picks an explored vertex v, relaxes all outgoing arcs of v, and sets S(v) = settled  ... 
doi:10.1111/j.1475-3995.2008.00649.x fatcat:77jh6um4fbc35eihpu4xcd4bf4

Algorithms for reconstruction of chromosomal structures

Vassily Lyubetsky, Roman Gershgorin, Alexander Seliverstov, Konstantin Gorbunov
2016 BMC Bioinformatics  
Conclusions: Exactness of the proposed algorithms and such low polynomial complexities were proved.  ...  Many heuristic algorithms were proposed for this purpose, but there are just a few exact algorithms with low (linear, cubic or similar) polynomial computational complexity among them to our knowledge.  ...  Acknowledgements We thank the Editors and anonymous reviewers for valuable comments and recommendations. The study was supported by the Russian Science Foundation (project no. 14-50-00150).  ... 
doi:10.1186/s12859-016-0878-z pmid:26780836 pmcid:PMC4717669 fatcat:t3zrkovw4vhrxf26gk3ajrkjvy

Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks [article]

Leo van Iersel, Steven Kelk, Matthias Mnich
2008 arXiv   pre-print
As a response to this intractability we give an exact algorithm for constructing level-1 networks consistent with a maximum number of input triplets.  ...  Phylogenetic networks provide a way to describe and visualize evolutionary histories that have undergone so-called reticulate evolutionary events such as recombination, hybridization or horizontal gene  ...  This problem is NP-hard 4, 14, 29 , and approximation algorithms have been explored both for the construction of trees 10 and level-1 networks 6, 15 .  ... 
arXiv:0712.2932v3 fatcat:56p7b7umjnamhhqzbstzkug2zq

A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization

Adrian Petcu, Boi Faltings
2007 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07)  
LS-DPOP(k) can be seen as a large neighborhood search, where exponential neighborhoods are rigorously determined according to problem structure, and polynomial efforts are spent for their complete exploration  ...  We present a new hybrid algorithm for local search in distributed combinatorial optimization.  ...  The algorithm explores independent parts of the problem simultaneously and asynchronously, and then combines the results, all in a distributed fashion.  ... 
doi:10.1109/iat.2007.12 dblp:conf/iat/PetcuF07a fatcat:wyvsg5gzf5hedbvymsitdgmlei

Bee Inspired Novel Optimization Algorithm and Mathematical Model for Effective and Efficient Route Planning in Railway System

Kah Huo Leong, Hamzah Abdul-Rahman, Chen Wang, Chiu Chuen Onn, Siaw-Chuing Loo, Jun Ma
2016 PLoS ONE  
The algorithm is then verified by comparing the results with the exact solutions in 10 test cases, and a numerical case study is designed to demonstrate the application with large size sample.  ...  The findings further support the reliability of the algorithm and capability to solve the problems with different complexity.  ...  wish to thank the Center of Building, Construction & Tropical Architecture of the Faculty of Built Environment, Center of Transport Research, Department of Civil Engineering, Faculty of Engineering, and  ... 
doi:10.1371/journal.pone.0166064 pmid:27930659 pmcid:PMC5145153 fatcat:ni3fd2q23za73n5hsrqaeax5ui

Incremental CTL model checking using BDD subsetting

Abelardo Pardo, Gary D. Hachtel
1998 Proceedings of the 35th annual conference on Design automation conference - DAC '98  
An automatic abstraction re nement algorithm for symbolic CTL model checking is presented.  ...  Both the re nement and the abstraction procedures are based in BDD-subsetting.  ...  The motivation for this decision is based on experimental data obtained by exploring the trade-o in time between approximate and exact computations.  ... 
doi:10.1145/277044.277171 dblp:conf/dac/PardoH98 fatcat:uxyhutlpfrfaxbacc2e35dj7mm

Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint

Nebojsa Bacanin, Milan Tuba
2014 The Scientific World Journal  
To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature.  ...  Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable.  ...  We adopted from the ABC algorithm parameter that controls and directs the exploration process.  ... 
doi:10.1155/2014/721521 pmid:24991645 pmcid:PMC4060745 fatcat:fyeftvro2najbbywitibpkqcp4

Sensitivity analysis of seismic depth migrations

Seward Pon, Laurence R. Lines
2005 Geophysics  
Great Explorations -Canada and Beyond  ...  in hydrocarbon exploration and development.  ...  Acknowledgements The authors would like to thank Don Lawton, John Bancroft, Pat Daley and Joan Embleton for reviewing and proofreading this paper.  ... 
doi:10.1190/1.1897036 fatcat:ay7p7mcqbjes5o2lnlpmaaysfa

An Asynchronous WFST-Based Decoder For Automatic Speech Recognition [article]

Hang Lv, Zhehuai Chen, Hainan Xu, Daniel Povey, Lei Xie, Sanjeev Khudanpur
2021 arXiv   pre-print
" and the other "backfill".  ...  We introduce asynchronous dynamic decoder, which adopts an efficient A* algorithm to incorporate big language models in the one-pass decoding for large vocabulary continuous speech recognition.  ...  Unfortunately, it is still difficult to generate an exact lattice with a huge LM in a fast way, so it is worthy to explore faster approaches.  ... 
arXiv:2103.09063v1 fatcat:gx4i3ivu6jdlfcc646rske5oxm

Artificial Bee Colony Algorithm Hybridized with Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Selection Problem

Milan Tuba, Nebojsa Bacanin
2014 Applied Mathematics & Information Sciences  
Portfolio selection (optimization) problem is a very important and widely researched problem in the areas of finance and economy.  ...  Comparison with other state-of-the-art optimization metaheuristics including genetic algorithms, simulated annealing, tabu search and particle swarm optimization (PSO) shows that our approach is superior  ...  Thus, in the ABC algorithm onlooker and employed bees are responsible for the exploitation process, while scouts take care of the exploration.  ... 
doi:10.12785/amis/080619 fatcat:jhdirnhaijdodm3vye4zx7yfhq
« Previous Showing results 1 — 15 out of 11,491 results