Results 251 to 260 of about 1,237,463 (291)
Some of the next articles are maybe not open access.
Communications of the ACM, 2013
Discovering surprises in the face of intractability.
Fedor V. Fomin, Petteri Kaski
openaire +1 more source
Discovering surprises in the face of intractability.
Fedor V. Fomin, Petteri Kaski
openaire +1 more source
Exact Permutation/Randomization Tests Algorithms
Journal of Statistical Theory and Practice, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Exact Algorithms for Planted Motif Problems
Journal of Computational Biology, 2005The problem of identifying meaningful patterns (i.e., motifs) from biological data has been studied extensively due to its paramount importance. Three versions of this problem have been identified in the literature. One of these three problems is the planted (l, d)-motif problem.
S, Rajasekaran, S, Balla, C-H, Huang
openaire +2 more sources
Exact Linear Algebra Algorithmic
Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation, 2015Exact linear algebra is a core component of many symbolic and algebraic computations, as it often delivers competitive theoretical complexities and also better harnesses the efficiency of modern computing infrastructures. In this tutorial we will present an overview on the recent advances in exact linear algebra algorithmic and implementation ...
openaire +1 more source
Exact Timing Analysis: Algorithm
1994The main problem in using the analysis strategy of the previous chapter is the exponential explosion of the space requirement for storing each of the responses and response constraints at each circuit element. This in turn causes an exponential explosion in run-time necessary to generate the responses.
C. Thomas Gray +2 more
openaire +1 more source
Mathematical Programming Models and Exact Algorithms
2022This chapter focusses on exact solution approaches for QUBO. We first discuss various mixed integer linear programming formulations, compare their relative strength in terms of LP relaxations, and resulting upper bounding strategies. Then, new developments based on semidefinite programming approaches are discussed in detail.
Punnen, Abraham P., Sotirov, Renata
openaire +2 more sources
1999
Having discussed several models for resource-constrained project scheduling in the previous chapter, we now deal with scheduling algorithms which compute optimal schedules for given projects. Due to the NP-hardness of the RCPSP and its extensions, however, we cannot expect the exact algorithms to determine optimal solutions for problems of larger size ...
openaire +1 more source
Having discussed several models for resource-constrained project scheduling in the previous chapter, we now deal with scheduling algorithms which compute optimal schedules for given projects. Due to the NP-hardness of the RCPSP and its extensions, however, we cannot expect the exact algorithms to determine optimal solutions for problems of larger size ...
openaire +1 more source
Exact Algorithms and Complexity
2010Over the past couple of decades, a series of exact exponential-time algorithms have been developed with improved run times for a number of problems including IndependentSet, k-SAT, and k-colorability using a variety of algorithmic techniques such as backtracking, dynamic programming, and inclusion-exclusion.
openaire +1 more source
Clinical management of metastatic colorectal cancer in the era of precision medicine
Ca-A Cancer Journal for Clinicians, 2022, Davide Ciardiello, Giulia Martini
exaly