Results 31 to 40 of about 85,241 (257)
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2012 We consider a repetitive routing problem of a single grasp-and-delivery robot used on a printed circuit board (PCB) assembly line. The robot arranges n identical pins from their current configuration to the next required one by transferring at most one ...
Aleksandar SHURBEVSKI +2 more
doaj +1 more source
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights
Algorithms, 2016 In the pursuit of finding subclasses of the makespan minimization problem on unrelated parallel machines that have approximation algorithms with approximation ratio better than 2, the graph balancing problem has been of current interest.
Daniel R. Page, Roberto Solis-Oba
doaj +1 more source
Special Issue on Graph Algorithms
Algorithms, 2013 This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Jesper Jansson
doaj +1 more source
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems
Algorithms, 2022 Motivated by applications in ride-sharing and truck-delivery, we study the problem of matching a number of requests and assigning them to cars. A number of cars are given, each of which consists of a location and a speed, and a number of requests are ...
Kelin Luo, Frits C. R. Spieksma
doaj +1 more source
Rounding in ¿-approximation algorithms
2006 Symposium on Communications and Vehicular Technology, 2006 A common approach to deal with NP-hard problems is to deploy polynomial-time ϵ-approximation algorithms. These algorithms often resort to rounding and scaling to guarantee a solution that is within a factor (1 + isin) of the optimal solution. Usually, researchers either only round up or only down.
openaire +4 more sources
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Gribonval, Rémi, Nielsen, Morten
openaire +3 more sources
Counting With Tinytable: Every Bit Counts!
IEEE Access, 2019 Bloom filters are space efficient data structures that support approximate membership queries. They are easily extensible but incur significant overheads when extended to support additional functionality, such as removals or counting.
Gil Einziger, Roy Friedman
doaj +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Two Approaches to Constructing Certified Dominating Sets in Social Networks
IEEE AccessSocial networks are an important part of our community. In this context, certified dominating sets help to find in networks a group of people, referring as officials, such that 1) for each civilian, there is an official that can serve the civilian, and 2)
Joanna Raczek, Mateusz Miotk
doaj +1 more source
Reachability in Biochemical Dynamical Systems by Quantitative Discrete Approximation (extended abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 In this paper, a novel computational technique for finite discrete approximation of continuous dynamical systems suitable for a significant class of biochemical dynamical systems is introduced.
L. Brim +3 more
doaj +1 more source