Exact Algorithms for the Canadian Traveller Problem on Paths and Trees by Karger, David, Nikolova, Evdokia

“…Since there has been no significant progress on approximation algorithms for several decades, we have chosen to seek out special cases for which exact solutions exist, in the hope of demonstrating techniques that could lead to further progress. …”
Get full text

Capturing graphs with hypo-elliptic diffusions by Toth, C, Lee, D, Hacker, C, Oberhauser, H

“…We provide theoretical guarantees and efficient low-rank approximation algorithms. In particular, this gives a structured approach to capture long-range dependencies on graphs that is robust to pooling. …”

Least Restrictive Supervisors for Intersection Collision Avoidance: A Scheduling Approach by Colombo, Alessandro, Del Vecchio, Domitilla

“…This allows us to leverage existing results in the scheduling literature to obtain both exact and approximate solutions. The approximate algorithms have polynomial complexity and can handle large problems with guaranteed approximation bounds. …”
Get full text
Get full text

Reliability in layered networks with random link failures by Lee, Kayi, Lee, Hyang-Won, Modiano, Eytan H.

“…Using random sampling techniques, we develop polynomial time approximation algorithms for the failure polynomial. Our approach gives an approximate expression for reliability as a function of the link failure probability, eliminating the need to resample for different values of the failure probability. …”
Get full text
Get full text

New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

“…Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
Get full text

Online Combinatorial Optimization for Digital Marketplaces by Susan, Fransisca

“…We present optimal approximation algorithms for both the offline and online settings.…”
Get full text

Geometric algorithms for reconfigurable structures by Benbernou, Nadia M

Get full text

Algorithmic Cluster Expansions for Quantum Problems by Ryan L. Mann, Romy M. Minko

“…We establish a general framework for developing approximation algorithms for a class of counting problems. …”
Get full text

Scheduling a Single Machine with Primary and Secondary Objectives by Nodari Vakhania

“…These properties, together with our general framework, provide the theoretical background, so that the basic framework can be expanded to (exponential-time) implicit enumeration algorithms and polynomial-time approximation algorithms (generating the Pareto sub-optimal frontier with a fair balance between the two objectives). …”
Get full text

Solving Robust Weighted Independent Set Problems on Trees and under Interval Uncertainty by Ana Klobučar, Robert Manger

“…Finally, two mutually related approximation algorithms for the min–max regret variant are proposed. …”
Get full text

A novel and effective method for solving the router nodes placement in wireless mesh networks using reinforcement learning. by Le Huu Binh, Thuy-Van T Duong

“…With heavy node density and wide-area WMNs, solving the RNP problem using approximation algorithms often faces many difficulties, therefore, a more effective solution is necessary. …”
Get full text

Genetic susceptibility, colony size, and water temperature drive white-pox disease on the coral Acropora palmata. by Erinn M Muller, Robert van Woesik

“…We took a Bayesian approach, using Integrated Nested Laplace Approximation algorithms, to examine which covariates influenced the presence of white-pox disease over seven years. …”
Get full text

Cookie Clicker by Xiao, Kai Yuanqing

Get full text

Nonlinear Latent Variable Models for Video Sequences by rahimi, ali, recht, ben, darrell, trevor

“…Given high-dimensional observations and a distribution describing the dynamical process, we present a computationally inexpensive approximate algorithm for estimating the inverse of this mapping. …”
Get full text

Approximate Correspondences in High Dimensions by Grauman, Kristen, Darrell, Trevor

“…Whereas previous matching approximation algorithms suffer from distortion factors that increase linearly with the feature dimension, we demonstrate thatour approach can maintain constant accuracy even as the feature dimension increases. …”
Get full text

Diverse sampling of streaming data by Turmukhametova, Aizana

Get full text

Low power design for approximate adders by Liu, Ling Li

“…Different kind of power consumption in CMOS circuits and ways to reduce these consumptions will be discussed in this dissertation. Some approximate algorithms provide a good opportunity for energy-efficient design by reducing accuracy requirements. …”
Get full text

Find your neighbors (quickly!) by Wong, Wei Tian.

“…Therefore in recent years, the approximate nearest neighbor solution was proposed to mitigate the curse of dimensionality issue. These approximate algorithms are known to provide large speedups with a minor tradeoff between the loss of efficiency or accuracy. …”
Get full text

ENFrame: a framework for processing probabilistic data by Olteanu, D, van Schaik, SJ

“…We propose a family of sequential and concurrent, exact, and approximate algorithms for computing the probability of interconnected events. …”

On support sizes of restricted isometry constants by Blanchard, J, Thompson, A

“…A generic tool for analyzing sparse approximation algorithms is the restricted isometry property (RIP) introduced by Candès and Tao (2005) [11]. …”