Let G = (N, E) be an edge-weightedundirected graph. The graph partitioning problem is the problem of partitioning the node set N into k disjoint subsets of specified sizes so as to minimize the total weight of the edges connecting nodes in distinct subsets of the partition. We present a numerical study on the use of eigenvalue-based techniques to find upper and lower bounds for this problem. Re...

We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer problems subject to assignment constraints. The resulting linearized formulation is more compact and tighter than that obtained with a more usual linearization technique. We discuss the application of the compact linearizatio...

Since the hardware-software partitioning problem is a key aspect of the codesign of digital electronic systems, extensive researches have been performed with diverse definitions of partitioning problems. However, existent partitioning solutions are not applicable to many real applications partly because of restricted input specification or insufficient constraints. In this paper, we aim to iden...

Local optimality conditions are given for a quadratic programming formulation of the multiset graph partitioning problem. These conditions are related to the structure of the graph and properties of the weights.

Filter Banks Tanja Karp(1) and Alfred Mertins(2) (1)Lehrstuhl f ur Elektrotechnik, Universit at Mannheim B6/26, D-68131 Mannheim, Germany, [email protected] (2) University of Kiel, Telecommunications Institute Kaiserstr. 2, D-24143 Kiel, Germany, [email protected] r esum e Cet article presente des implantations optimis ees de ltres prototypes de bancs de ltres modul es a reconst...

ffects of pressure ratio and rotational speed on the leakage flow nd cavity pressure characteristics of the rotating staggered labyinth seal were investigated by means of experimental measureents and numerical simulations. The rotating seal test rig with urbine flowmeter and pressure measuring instruments was utiized to investigate the leakage flow of the staggered labyrinth eal at eight pressu...

We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as a-0 pruning provides over minimax.

A partition of a positive integer n (or a partition of weight n) is a non-decreasing sequence λ = (λ1, λ2, . . . , λk) of non-negative integers λi such that ∑k i=1 λi = n. The λi’s are the parts of the partition λ. Integer partitions are of particular interest in combinatorics, partly because many profound questions concerning integer partitions, solved and unsolved, are easily stated, but not ...

We introduce partition equilibrium and study its existence in resource selection games (RSG). In partition equilibrium the agents are partitioned into coalitions, and only deviations by the prescribed coalitions are considered. This is in difference to the classical concept of strong equilibrium according to which any subset of the agents may deviate. In resource selection games, each agent sel...

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely partition-distance D(·, ·). The comparison achieves by checking their restriction to modular elements of the partition lattice, as well as in terms of suitable classifiers. Two of the new measures obtain through the size, a function mapping every ...