Results 51 to 60 of about 1,533,628 (86)

Practical algorithms for linear boolean-width [PDF]

, 2015
In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms.
Brinke, Chiel B ten, ten Brinke, C.B., Van Houten, Frank J P, Houten, Frank J P Van, Ten Brinke, Chiel B., van Houten, F.J.P., van Houten, Frank J. P., Bodlaender, H.L., Bodlaender, Hans L., Sub Algorithms and Complexity, Bodlaender, HL Hans   +10 more
core   +2 more sources

Graph Algorithms

, 1979
The recent progress concerning efficient algorithms for graph processing and graph theory.
S. Even
core  

Algorithms for Locating Facilities under Uncertainties [PDF]

, 2008
One of the main challenges in the area of discrete optimization is to find efficient and effective ways of solving problems that arise in day-to-day life. Traditionally, algorithms for such problems require complete knowledge of input parameters which is
Nagarajan, Chandrashekhar
core  

Algorithms

, 2019
Algorithms To Supports Individual Fairness by Incorporating System Design ...
conFair conFair (7050578)
core   +1 more source

The polymorphic gateway between structure and algorithms: Beyond CSPs

, 2018
Presented on December 3, 2018 at 11:00 a.m. in the Klaus Advanced Computing Building, Room 1116E.Venkatesan Guruswami is a Professor in the School of Computer Science at Carnegie Mellon University.
Guruswami, Venkat
core  

Data-Flow Algorithms for Parallel Matrix Computations

, 1985
In this article the authors develop some algorithms and tools for solving matrix problems on parallel processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to ...
Dianne P. O’Leary, D. O'Leary, G.W. Stewart, G. W. Stewart   +3 more
core  

Markov Chain Algorithms for Programmable Active Matter

, 2018
Presented as part of the Workshop on Algorithms and Randomness on May 16, 2018 at 2:45 p.m. in the Klaus Advanced Computing Building, Room 1116.Dana Randall is the Co-Executive Director, Institute for Data Engineering and Science, the ADVANCE Professor ...
Randall, Dana
core  

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around [PDF]

, 2018
A fundamental graph problem is to recognize whether the vertex set of a graph G can be bipartitioned into sets A and B such that G[A] and G[B] satisfy properties Pi_A and Pi_B, respectively.
Herman, Grzegorz, van Leeuwen, Erik Jan, Bast, Hannah, Komusiewicz, Christian, Azar, Yossi, Kanj, Iyad, Sorge, Manuel, Kanj, Iyad A., Sub Algorithms and Complexity, Leeuwen, Erik Jan van, Algorithms and Complexity   +10 more
core   +2 more sources

Algorithms and Data Structures

, 1986
The book reflects the development of the use of computers and sophisticated algorithms to prepare and automatically typeset documents. It develops programs in step-wise fashion and express them in a well structured, detailed presentation.
N. Wirth, Wirth, Niklaus
core  

A Survey of Shadow Algorithms

, 1990
This survey characterizes the various types of shadows. It also describes most existing shadow algorithms and discusses their complexities, advantages, and shortcomings.
A. Woo, A. Fournier, P. Poulin
core