Results 41 to 50 of about 120,483 (167)
A New Randomized Algorithm for Handling Scheduling Conflicts in Grids
Advances in Electrical and Computer Engineering, 2009 As the scale of Grid platforms grows, the idea of a centralized scheduler loses its efficiency, and it is replaced with the scheme of decentralized schedulers.
VAHDAT-NEJAD, H., ZAMANIFAR, K.
doaj +1 more source
Probability-boosting technique for combinatorial optimization [PDF]
PeerJ Computer ScienceIn many combinatorial optimization problems we want a particular set of k out of n items with some certain properties (or constraints). These properties may involve the k items.
Sanpawat Kantabutra
doaj +2 more sources
A Randomized Algorithm for CCA
CoRR, 2014 We present RandomizedCCA, a randomized algorithm for computing canonical analysis, suitable for large datasets stored either out of core or on a distributed file system. Accurate results can be obtained in as few as two data passes, which is relevant for distributed processing frameworks in which iteration is expensive (e.g., Hadoop). The strategy also
Paul Mineiro, Nikos Karampatziakis
openaire +3 more sources
Fast edge colorings with fixed number of colors to minimize imbalance
Journal of Graph Algorithms and Applications, 2008 We study the following optimization problem: the input is a multigraph G=(V,E) and an integer parameter g. A feasible solution consists of a (not necessarily proper) coloring of E with colors 1, 2, …, g.
Gruia Calinescu, Michael Pelsmajer
doaj +1 more source
An introduction to randomized algorithms
Discrete Applied Mathematics, 1991 The concept of randomization is known to be an extremely important tool for the design of algorithms. Its use often yields better time or space complexity compared with the best deterministic algorithms we know of for the same problem; moreover resulting randomized algorithms are often very simple to understand and implement.
openaire +2 more sources
A randomized maximum-flow algorithm [PDF]
30th Annual Symposium on Foundations of Computer Science, 1989 Summary: A randomized algorithm for computing a maximum flow is presented. For an \(n\)-vertex \(m\)-edge network, the running time is \(O(nm + n^2 (\log n)^2)\) with probability at least \(1 - 2^{- \sqrt {nm}}\). The algorithm is always correct, and in the worst case runs in \(O(nm \log n)\) time.
Cheriyan, J., Hagerup, T.
openaire +4 more sources
Randomized Parameterized Algorithms for the Kidney Exchange Problem
Algorithms, 2019 In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries.
Mugang Lin +3 more
doaj +1 more source
A Monad for Randomized Algorithms
Electronic Notes in Theoretical Computer Science, 2016 AbstractIn this paper, we introduce a monad of random choice for domains that does not suffer from the main two drawbacks of the probabilistic powerdomain. It is not known whether any Cartesian closed category of domains is closed under the probabilistic powerdomain, but the Cartesian closed category BCD is closed under this monad of random choice ...
openaire +1 more source
A Randomized Algorithm for 3-SAT [PDF]
Mathematics in Computer Science, 2010 In this work we propose and analyze a simple randomized algorithm to find a satisfiable assignment for a Boolean formula in conjunctive normal form (CNF) having at most 3 literals in every clause. Given a k-CNF formula phi on n variables, and alpha in{0,1}^n that satisfies phi, a clause of phi is critical if exactly one literal of that clause is ...
Subhas Kumar Ghosh, Janardan Misra
openaire +4 more sources
On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems
Algorithms, 2019 Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Angel Alejandro Juan +4 more
doaj +1 more source