task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other on...

This paper presents a Cuckoo Optimization Algorithm (COA) model for the cost optimization of the one-way and two-way reinforced concrete (RC) slabs according to ACI code. The objective function is the total cost of the slabs including the cost of the concrete and that of the reinforcing steel. In this paper, One-way and two-way slabs with various end conditions are formulated as ACI code. The t...

One-way functions are easy to compute but hard to invert; their existence is the foundational assumption for modern cryptography. Oded Goldreich’s 2000 paper “Candidate One-Way Functions Based on Expander Graphs” [6] proposes a candidate one-way function construction based on any small fixed predicate over d variables and a bipartite expander graph of right-degree d. The function is calculated ...

A competitive analysis method for online algorithms is developed based on the idea of instance transformation. The method is applied on a single machine online scheduling problem where an assumption is made that the longest processing time among the jobs in any instance is not longer than a constant, say γ, times the shortest processing time. An online algorithm is designed and its competitive ...

Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipartite expanding graph of right-degree d. The function is computed by labeling the n vertices on the left with the bits of the input, labeling each of the n vertices on the right with the value of the predicate applied to the ne...

Two ingredients of soft computing, evolutionary computing and fuzzy logic can be combined in a way that makes them beneet from one another. An evolutionary algorithm can evolve fuzzy systems, while fuzzy logic can be used to control evolution to speed up convergence to a global optimum and escape from local optima. Besides, concepts that are inherent in the workings of evolutionary algorithms, ...

Hypergraphs are generalizations of graphs where an edge can consist of more than two nodes. A reoccurring task is to divide the node set of a hypergraph into k different non-empty parts where we simultaneously want to minimize a partitioning objective. This problem is called the k-way hypergraph partitioning problem. Applications can be found in the area of VLSI design and the parallelization o...

Balanced multi-way number partitioning (BMNP) seeks to split a collection of numbers into subsets with (roughly) the same cardinality and subset sum. The problem is NP-hard, and there are several exact and approximate algorithms for it. However, existing exact algorithms solve only the simpler, balanced two-way number partitioning variant, whereas the most effective approximate algorithm, BLDM,...

In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed out in [3], the problem can be approximately transformed into the vector partitioning problem by mapping each circuit component to a multi-dimensional vector. The common key idea of our two algorithms for solving the v...