Results 21 to 30 of about 2,298,639 (295)
Algorithms, 2013 We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier +2 more
doaj +1 more source
Exact and Fast Numerical Algorithms for the Stochastic Wave Equation [PDF]
, 2003 On the basis of integral representations we propose fast numerical methods to solve the Cauchy problem for the stochastic wave equation without boundaries and with the Dirichlet boundary conditions.
Martin, A. +9 more
core +1 more source
05301 Abstracts Collection – Exact Algorithms and Fixed-Parameter Tractability [PDF]
, 2006 From 24.07.05 to 29.07.05, the Dagstuhl Seminar 05301 ``Exact Algorithms and Fixed-Parameter Tractability'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Woeginger, Gerhard +2 more
core +1 more source
Quantum‐based exact pattern matching algorithms for biological sequences
ETRI Journal, 2021 In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in ON time, whereas quantum algorithm design is based on ...
Kapil Kumar Soni, Akhtar Rasool
doaj +1 more source
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender +2 more
openaire +5 more sources
Exact algorithms for the clustered vehicle routing problem [PDF]
, 2014 This study presents new exact algorithms for the Clustered Vehicle Routing Problem (CluVRP). The CluVRP is a generalization of the Capacitated Vehicle Routing Problem (CVRP), in which the customers are grouped into clusters.
Vigo, Daniele +8 more
core +1 more source
PERFORMANCE ANALYSIS OF OPTIMIZATION METHODS FOR SOLVING TRAVELING SALESMAN PROBLEM
Сучасний стан наукових досліджень та технологій в промисловості, 2021 The subject of this research is distance and time of several city tour problems which known as traveling salesman problem (tsp). The goal is to find out the gaps of distance and time between two types of optimization methods in traveling salesman problem:
Chandra Agung, Natalia Christine
doaj +1 more source
Iterative compression and exact algorithms
Theoretical Computer Science, 2008 Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of exact exponential time algorithms. We exemplify our findings with algorithms for the Maximum Independent Set problem, a counting version of k-Hitting Set ...
Fomin, Fedor V. +4 more
openaire +4 more sources
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Tsinghua Science and Technology, 2014 Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Robert Bredereck +5 more
doaj +1 more source
Exact Algorithms for Intervalizing Colored Graphs [PDF]
Theory of Computing Systems, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender +1 more
openaire +6 more sources