135 Hits in 28.4 sec

On Creating Complementary Pattern Databases

Santiago Franco, Álvaro Torralba, Levi H. S. Lelis, Mike Barley
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
A pattern database (PDB) for a planning task is a heuristic function in the form of a lookup table that contains optimal solution costs of a simplified version of the task.  ...  Our results show that the heuristics produced by our approach are able to outperform existing schemes, and that our method is able to create PDBs that complement the strengths of other existing heuristics  ...  We model the problem of deciding which bin-packing algorithm to use as a multi-armed bandit problem where each algorithm represents an arm.  ... 
doi:10.24963/ijcai.2017/601 dblp:conf/ijcai/FrancoTLB17 fatcat:h7sipmionnaxlejnz4wtxozqpm

The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks

S. Richter, M. Westphal
2010 The Journal of Artificial Intelligence Research  
We show that in some domains a search that ignores cost solves far more problems, raising the question of how to deal with action costs more effectively in the future.  ...  Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must be true in every solution of a planning task.  ...  The computing resources for our experiments were graciously provided by Pompeu Fabra University. We thank Héctor Palacios for his support in conducting the experiments.  ... 
doi:10.1613/jair.2972 fatcat:e5cn7dwwrfgindeuvtlysdpz7i

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
We present the formal mathematical model of the problem, which is NP-hard, and propose list heuristics as well as the genetic algorithm solving it.  ...  in one-way carsharing systems as an approach to solve vehicle stock imbalance.  ...  -Optimal Dynamic Tax Evasion: A Portfolio Approach Francesco Menoncin, Economics, Brescia University, Via S. Faustino, 74/B, 25122, Brescia, Italy,, Rosella Levaggi  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

FFRob: Leveraging symbolic planning for efficient task and motion planning

Caelan Reed Garrett, Tomás Lozano-Pérez, Leslie Pack Kaelbling
2017 The international journal of robotics research  
We present the FFRob algorithm for solving task and motion planning problems.  ...  We adapt existing heuristic search ideas for solving strips planning problems, particularly delete-relaxations, to solve EAS problem instances.  ...  Gregory et al. also gave a heuristic search algorithm for solving PMT problems. Its heuristic is a extension of h max .  ... 
doi:10.1177/0278364917739114 fatcat:2nccxehwvvbbjiljq73aq2fnhi

Point-estimating observer models for latent cause detection

Jennifer Laura Lee, Wei Ji Ma, Jean Daunizeau
2021 PLoS Computational Biology  
For instance, a spatial cluster of ants allows us to infer the presence of a common food source.  ...  We show that subject behaviour deviates qualitatively from Bayes-optimal, in particular showing an unexpected positive effect of N (the number of visual items) on the false-alarm rate.  ...  The problem of perceptual grouping can be conceptualized as an instance of the broader problem of detecting a latent cause (e.g., a partially occluded object), or delimiting its effects, based on directly  ... 
doi:10.1371/journal.pcbi.1009159 pmid:34714835 pmcid:PMC8580258 fatcat:pauroitgrnaorlcayrfm5fie7u

Designing Statistical Language Learners: Experiments on Noun Compounds [article]

Mark Lauer
1996 arXiv   pre-print
In pursuit of that goal, the thesis makes two main theoretical contributions: (i) it identifies a new class of designs by specifying an architecture for natural language analysis in which probabilities  ...  These results suggest that the new class of designs identified is a promising one. The experiments also serve to highlight the need for a widely applicable theory of data requirements.  ...  In chapter 5, I will develop a probabilistic model of this problem in detail; however, solving the problem of bracketing compounds is not their main aim and the performance of the heuristic is apparently  ... 
arXiv:cmp-lg/9609008v1 fatcat:yipwhts6ybhknmwimhbqrhchv4

Dos and Don'ts of Machine Learning in Computer Security [article]

Daniel Arp, Erwin Quiring, Feargus Pendlebury, Alexander Warnecke, Fabio Pierazzi, Christian Wressnegger, Lorenzo Cavallaro, Konrad Rieck
2021 arXiv   pre-print
In an empirical analysis, we further demonstrate how individual pitfalls can lead to unrealistic performance and interpretations, obstructing the understanding of the security problem at hand.  ...  With the growing processing power of computing systems and the increasing availability of massive datasets, machine learning algorithms have led to major breakthroughs in many different areas.  ...  for solving a security problem [e.g., 8] .  ... 
arXiv:2010.09470v2 fatcat:jo57jk3snjd7tchygcjemej6p4

Point-estimating observer models for latent cause detection [article]

Jennifer L Lee, Wei Ji Ma
2021 bioRxiv   pre-print
For instance, a spatial cluster of ants allows us to infer the presence of a common food source.  ...  We show that subject behaviour deviates qualitatively from Bayes-optimal, in particular showing an unexpected positive effect of N (the number of visual items) on the false-alarm rate.  ...  Data and code Data and code for the experiment and analysis are available at  ... 
doi:10.1101/2021.06.10.447855 fatcat:7ziykzgrhne3xi3oq2i2zillym

Identity Matrix [chapter]

2013 Encyclopedia of Operations Research and Management Science  
The queue length process in the M/G/1 queueing system is not Markovian, but can be analyzed via a Markov chain at service completion time points.  ...  An analysis technique used to analyze a queueing system that is not a continuous-time Markov chain.  ...  Analysis for public decisions (3rd ed.). New York: North Holland. Radin, B. A., & Coffee, J. N. (1993). A critique of TQM: Problems of implementation in the public sector.  ... 
doi:10.1007/978-1-4419-1153-7_200302 fatcat:ph4et3usavg4zcpkzfp4yz5qlu

Adaptable and Data-Driven Softwarized Networks: Review, Opportunities, and Challenges[40pt]

Wolfgang Kellerer, Patrick Kalmbach, Andreas Blenk, Arsany Basta, Martin Reisslein, Stefan Schmid
2019 Proceedings of the IEEE  
This paper identifies the opportunities and challenges of adaptable softwarized networks and introduces a conceptual framework for adaptations in softwarized networks.  ...  We review the wide range of options for fine-granular observations as well as fine-granular composition and control Manuscript  ...  While many similar optimization problems exist in SDN-and NFV-based networks, many underlying problems relate to the classical optimization tasks: bin packing and set covering.  ... 
doi:10.1109/jproc.2019.2895553 fatcat:k5kucpmukfgf5ol7vg7j5di4f4

Optimized Preference-Aware Multi-path Video Streaming with Scalable Video Coding [article]

Anis Elgabli, Ke Liu, Vaneet Aggarwal
2018 arXiv   pre-print
Even though the formulation is a non-convex discrete optimization, we show that the problem can be solved optimally with a polynomial complexity in some special cases.  ...  Simultaneous access of multiple interfaces can significantly improve the users' quality of experience (QoE) in video streaming. An intuitive approach to achieve it is to use Multi-path TCP (MPTCP).  ...  Specifically, we solve the proposed integer-constrained problem using an easyto-solve packing based algorithm. • We also propose special cases of our approach, i.e., a set of single path adaptive streaming  ... 
arXiv:1801.01980v2 fatcat:vknmmcwx6vcg3nval2hl77hx3q

Shedding Light on Black Box Machine Learning Algorithms: Development of an Axiomatic Framework to Assess the Quality of Methods that Explain Individual Predictions [article]

Milo Honegger
2018 arXiv   pre-print
In this thesis, we thus propose an axiomatic framework, which allows comparing the quality of different explanation methods amongst each other.  ...  Driven by the needs of industry and practice, the research community has recognised this interpretability problem and focussed on developing a growing number of so-called explanation methods over the past  ...  Several well-known data binning rules or algorithms could be used to generate a set of initial bins. With the bins, we could fundamentally proceed as in the classification case.  ... 
arXiv:1808.05054v1 fatcat:vokg4heebbhajbw63aundexotq

Learning Bayesian Network Equivalence Classes with Ant Colony Optimization

R. Daly, Q. Shen
2009 The Journal of Artificial Intelligence Research  
Bayesian networks are a useful tool in the representation of uncertain knowledge. This paper proposes a new algorithm called ACO-E, to learn the structure of a Bayesian network.  ...  The results of testing show that ACO-E performs better than a greedy search and other state-of-the-art and metaheuristic algorithms whilst searching in the space of equivalence classes.  ...  Acknowledgments The authors are grateful to the Associate Editor and reviewers for their comments, which were very helpful in guiding the revision of this research.  ... 
doi:10.1613/jair.2681 fatcat:4xuhro5hsvektlnvdaifmvl42q

Visible Light-Assisted Soft-Chemistry Route to Silver Nanomaterials at Room Temperature

Yi Wu, Xin Liu, Zi Huang, Xiang Fei He, Xi Yang, Qing Li
2019 Key Engineering Materials  
The result showed that the nanoparticles are spherical and cube. The effect of temperature on the morphology and properties of silver nanoparticles was investigated.  ...  Silver nanoparticles (AgNPs) were synthesizd by a light-assisted liquid phase reduction method with sodium hypophosphite as a reducing agent. DTAB was used to perform as the surfactant.  ...  algorithm for solving an optimization problem using the central path method.  ... 
doi:10.4028/ fatcat:xara5sxzf5fsvbib2dy6vrl7j4

The Effect of Signaling Rate on Information Rate for Single Carrier Linear Transmission Systems

Dzevdan Kapetanovic, Fredrik Rusek
2012 IEEE Transactions on Communications  
The main difficulty in finding the optimal precoders is the discrete nature of the problem, and mostly suboptimal solutions are proposed.  ...  Later, an iterative optimization method is developed, which produces precoders improving upon the best known ones in the literature.  ...  Another possibility is to solve (3.6) by an algorithmic approach, which is the focus of Section 3.3.  ... 
doi:10.1109/tcomm.2012.12.100598 fatcat:lmbw7wj5bnbh7aryydoufroilq
« Previous Showing results 1 — 15 out of 135 results