Filters








68,083 Hits in 4.7 sec

Integration of Statistical Selection with Search Mechanism for Solving Multi-Objective Simulation-Optimization Problems

Loo Lee, Ek Chew, Suyan Teng
2006 Proceedings of the 2006 Winter Simulation Conference  
Our main purpose is to study how to integrate statistical selection with search mechanism to address the above difficulties, and to present a general solution framework for solving such problems.  ...  For illustration, MOCBA is integrated with two meta-heuristics: multi-objective evolutionary algorithm (MOEA) and nested partitions (NP) to identify the nondominated solutions for two inventory management  ...  The integrated NP framework (described below) is developed for problems with two-dimensional search space: and s Q .  ... 
doi:10.1109/wsc.2006.323086 dblp:conf/wsc/LeeCT06 fatcat:2yvnbyoegbdhpldqatgs7kswwa

Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time [article]

Iddo Drori, Anant Kharkar, William R. Sickinger, Brandon Kates, Qiang Ma, Suwen Ge, Eden Dolev, Brenda Dietrich, David P. Williamson, Madeleine Udell
2020 arXiv   pre-print
In this work, we develop a new framework to solve any combinatorial optimization problem over graphs that can be formulated as a single player game defined by states, actions, and rewards, including minimum  ...  Combinatorial optimization algorithms for graph problems are usually designed afresh for each new problem with careful attention by an expert to the problem structure.  ...  Polynomial problems can be solved using GNNs without RL or search, which may be considered as a fast type-1 process; whereas NP-hard problems require RL or search, which are akin to a slow type-2 process  ... 
arXiv:2006.03750v2 fatcat:skeztpkbavhi5jde77rxru2uuy

Sparse Coding with Fast Image Alignment via Large Displacement Optical Flow [article]

Xiaoxia Sun, Nasser M. Nasrabadi, Trac D. Tran
2015 arXiv   pre-print
A corresponding supervised dictionary learning algorithm is also developed for the proposed framework.  ...  In this paper, having both training and test images misaligned, we introduce a novel sparse coding framework that is able to efficiently adapt the dictionary atoms to the test image via large displacement  ...  The optimization problem in ( 2 ) is a mixed-integer problem and NP-hard [12] .  ... 
arXiv:1512.06709v1 fatcat:eocfwa2p3fbyrbtitgk5rypipu

Learning-Based Approaches for Graph Problems: A Survey [article]

Kai Siong Yow, Siqiang Luo
2022 arXiv   pre-print
Over the years, many graph problems specifically those in NP-complete are studied by a wide range of researchers.  ...  Most of these problems are typically addressed by exact algorithms, approximate algorithms and heuristics. There are however some drawback for each of these methods.  ...  Hence, it is natural for researchers to apply this learning-based approach in solving NP-hard graph optimisation problems.  ... 
arXiv:2204.01057v2 fatcat:6oinpd56njcu5ait43327r6ege

Single-based and Population-Based Metaheuristics Algorithms Performances in Solving NP-hard Problems

Saman Almufti
2021 Iraqi Journal of Science  
paper compare the results of EHO and TS for solving 10 different problems from the TSPLIB95.  ...  It also will compare the performance two metaheuristic-based algorithms (Elephant Herding optimization algorithm and Tabu Search) to solve Traveling Salesman Problem (TSP), which is one of the most known  ...  Commonly, two categories of algorithms are used to solve or optimize a solution for NP-hard problems, namely the complete search algorithms and the approximate search algorithms.  ... 
doi:10.24996/10.24996/ijs.2021.62.5.34 fatcat:kesiw24gyjc4vdchzgpjfkygfm

Reinforcement Learning in Partially Observable Markov Decision Processes using Hybrid Probabilistic Logic Programs [article]

Emad Saad
2010 arXiv   pre-print
We show that the complexity of finding a policy for a reinforcement learning problem in our approach is NP-complete.  ...  We also show that a reinforcement learning problem can be encoded as a SAT problem. We present a new high level action description language that allows the factored representation of POMDP.  ...  satisfiability problem and solving the stochastic satisfiability problem instead.  ... 
arXiv:1011.5951v1 fatcat:yrfozvp2hfgyflt2p36l6tiata

Forthcoming Papers

2003 Artificial Intelligence  
We develop a model of problem difficulty for tabu search in the JSP, borrowing from similar models developed for SAT and other NP-complete problems.  ...  Similarly, our research represents the first attempt to quantitatively model the cost of tabu search for any NP-complete problem, and may possibly be leveraged in an effort to understand tabu search in  ...  We develop a model of problem difficulty for tabu search in the JSP, borrowing from similar models developed for SAT and other NP-complete problems.  ... 
doi:10.1016/s0004-3702(02)00392-2 fatcat:p7t7elwpqfaibltbci7l6o26ei

Constraint-based local search for solving non-simple paths problems on graphs

Quang-Dung Pham, Phan-Thuan Do, Yves Deville, Tuong-Vinh Ho
2010 Proceedings of the 2010 Symposium on Information and Communication Technology - SoICT '10  
LS(Graph) is a generic framework allowing to model and solve constrained optimum paths problems on graphs by local search where paths are known to be elementary (i.e., edges, vertices cannot be repeated  ...  Given an undirected weighted graph G = (V, E) representing a transportation network and a vertex v0 ∈ V representing the depot, the RNC problem consists of routing a fleet of unlimited number of identical  ...  We also propose a novel routing problem on networks (RNC) which is proved to be NP-hard and we apply the framework for solving this problem.  ... 
doi:10.1145/1852611.1852613 dblp:conf/soict/DungDDH10 fatcat:wukiida2czdq7au4qmyjkuf2ga

The Algorithm for Algorithms: An Evolutionary Algorithm Based on Automatic Designing of Genetic Operators

Dazhi Jiang, Zhun Fan
2015 Mathematical Problems in Engineering  
At present there is a wide range of evolutionary algorithms available to researchers and practitioners.  ...  A more complete definition of the question is "can computer construct an algorithm which will generate algorithms according to the requirement of a problem?"  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their very detailed and helpful comments that help us to increase the quality of this work.  ... 
doi:10.1155/2015/474805 fatcat:uzgqpw5bejhifndyrtoxsao3e4

Minimum-Energy Wireless Real-Time Multicast by Joint Network Coding and Scheduling Optimization

Guoping Tan, Yandan Zhu, Yueheng Li, Lili Zhang, Jing Xu
2015 Mathematical Problems in Engineering  
This method transforms the NP-hard scheduling subproblem into a normal linear programming problem to obtain an approximate solution.  ...  The proposed algorithm only needs to adopt centralized technique for solving the linear programming problem while all of the other computations can be distributed.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for valuable comments and suggestions for improving the quality of this paper.  ... 
doi:10.1155/2015/390457 fatcat:bkxjaruxyza3fbn5iycnvvstwi

A Cloud-based Conceptual Framework for Multi-Objective Virtual Machine Scheduling using Whale Optimization Algorithm

Nadim Rana, Muhammad Shafie Abd Latiff, Shafi'i Muhammad Abdulhamid
2018 International Journal of Innovative Computing  
This paper presents a conceptual framework for solving multi-objective VM scheduling problem using novel metaheuristic Whale optimization algorithm (WOA).  ...  Due to the fact that scheduling is an NP-hard problem, a metaheuristic approach is proven to achieve a better optimal solution to solve this problem.  ...  ACKNOWLEDGMENT The authors would like to acknowledge the support of the Pervasive Computing Research Group for conducting this research in Faculty of Computing at Universiti Teknologi Malaysia.  ... 
doi:10.11113/ijic.v8n3.199 fatcat:kkz7psvs5jddzpxlmld2qbvnly

The Optimization of Feature Selection Based on Chaos Clustering Strategy and Niche Particle Swarm Optimization

Longzhen Duan, Shuqing Yang, Dongbo Zhang
2020 Mathematical Problems in Engineering  
It has been proved that solving the new model is equivalent to solving a NP problem with a flexible and adaptable norm regularization.  ...  With the rapid increase of the data size, there are increasing demands for feature selection which has been a powerful tool to handle high-dimensional data.  ...  Feature selection has been proved to be a NP hard combinational optimization problem. ere is no polynomial algorithm to solve it accurately.  ... 
doi:10.1155/2020/3138659 fatcat:gfhygqmy2fg6xkr56su5p3fzme

Hybrid Multi-Agent Architecture (HMAA) for meeting scheduling

Serein Al-Ratrout, Francois Siewe, Omar Al-Dabbas, Mai Al-Fawair
2010 2010 7th International Multi- Conference on Systems, Signals and Devices  
The proposed architecture is a new Hybrid Multi-Agent Architecture (HMAA) that generates new heuristics for solving NP hard problems.  ...  This paper presents a novel multi-agent architecture for meeting scheduling.  ...  The experiments have been done on both frameworks search and optimisation problem solving frameworks.  ... 
doi:10.1109/ssd.2010.5585505 fatcat:kadrbz6vxndo7d7ohmpzqhjdy4

Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems

Gabriel A. Fonseca Guerra, Steve B. Furber
2017 Frontiers in Neuroscience  
stochastic search that solves instances of P and NP problems expressed as CSPs.  ...  We demonstrate the basic principles of the framework by solving difficult instances of the Sudoku puzzle and of the map color problem, and explore its application to spin glasses.  ...  ACKNOWLEDGMENTS The authors would like to thank Andrew Rowley for helpful discussions as well as Michael Hopkins and Mantas Mikaitis for proof reading and valuable suggestions to the manuscript.  ... 
doi:10.3389/fnins.2017.00714 pmid:29311791 pmcid:PMC5742150 fatcat:2iiiwhnxnffapon2aswaju27we

BooM

Chih-Fan Lai, Jie-Hong R. Jiang, Kuo-Hua Wang
2010 Proceedings of the 47th Design Automation Conference on - DAC '10  
In contrast, this paper focuses on the computation kernel of Boolean matching and proposes a complete generic framework.  ...  Due to its broad applications in logic synthesis and verification, it attracted much attention. Most prior efforts however were incomplete and/or restricted to certain special matching conditions.  ...  Acknowledgments The authors are grateful to Bo-Han Wu for helpful discussion, and National Science Council for grants 96-2221-E-002-278-MY3 and 98-2221-E-030-016.  ... 
doi:10.1145/1837274.1837398 dblp:conf/dac/LaiJW10 fatcat:fre2vbtntvcs3a76kf2px3czry
« Previous Showing results 1 — 15 out of 68,083 results