Results 1  10
of
533,920
ALGORITHMS FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS
, 1957
"... In this paper we presen algorithms for the solution of the general assignment and transportation problems. In Section 1, a statement of the algorithm for the assignment problem appears, along with a proof for the correctness of the algorithm. The remarks which constitute the proof are incorporated p ..."
Abstract

Cited by 454 (0 self)
 Add to MetaCart
omitted. 1. THE ASSIGNMENT PROBLEM. The personnelassignment problem is the problem of choosing an optimal assignment of n men to n jobs, assuming that numerical ratings are given for each man’s performance on each job. An optimal assignment is one which makes the sum of the men’s ratings
On the optimal assignment of conference papers to reviewers
, 2009
"... This monograph will describe an algorithm for optimally assigning conference papers to reviewers. The process was developed and used for CVPR 2006 (the IEEE Conference on Computer Vision and Pattern Recognition) where it successfully ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This monograph will describe an algorithm for optimally assigning conference papers to reviewers. The process was developed and used for CVPR 2006 (the IEEE Conference on Computer Vision and Pattern Recognition) where it successfully
Optimal Assignment of Liabilities
"... Abstract I characterize a generalization of the negligence rule to assign compensating damages in an accident involving multiple tortfeasors. These tortfeasors have the opportunity to undertake spending in prevention and the rule is designed to provide them with the best incentives to do so. I stud ..."
Abstract
 Add to MetaCart
Abstract I characterize a generalization of the negligence rule to assign compensating damages in an accident involving multiple tortfeasors. These tortfeasors have the opportunity to undertake spending in prevention and the rule is designed to provide them with the best incentives to do so. I
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 1003 (8 self)
 Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive
On the Optimal Assignment of Customers to Parallel Servers
 J. Appl. Probability
, 1978
"... We consider a queuing system with several identical servers, each with its own queue. Identical customers arrive according to some stochastic process and as each customer arrives it must be assigned to some server's queue. No jockeying amongst the queues is allowed. We are interested in assigni ..."
Abstract

Cited by 60 (2 self)
 Add to MetaCart
We consider a queuing system with several identical servers, each with its own queue. Identical customers arrive according to some stochastic process and as each customer arrives it must be assigned to some server's queue. No jockeying amongst the queues is allowed. We are interested
Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization
, 1993
"... The paper describes a rankbased fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs). Conventional niche formation methods are extended to this class of multimodal problems and theory for setting the niche size is presented. The fitness assignment method is then modified to a ..."
Abstract

Cited by 633 (15 self)
 Add to MetaCart
The paper describes a rankbased fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs). Conventional niche formation methods are extended to this class of multimodal problems and theory for setting the niche size is presented. The fitness assignment method is then modified
Approximately Optimal Assignment For Unequal Loss Protection
 IN PROC. INT'L CONF. IMAGE PROCESSING
, 1999
"... This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1]. It first finds the optimal assignment under convex hull and fractional bit allocation assumptions. It then relaxes tho ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1]. It first finds the optimal assignment under convex hull and fractional bit allocation assumptions. It then relaxes
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
time and all other standard heap operations in o ( 1) amortized time. Using Fheaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worstcase bounds, where n is the number of vertices and m the number of edges
Optimal assignment kernels for attributed molecular graphs
 In Proceedings of the 22nd international conference on Machine learning
, 2005
"... We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another one, including information on neighborhood, membership to a certain structural element and other characteristics fo ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another one, including information on neighborhood, membership to a certain structural element and other characteristics
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 657 (27 self)
 Add to MetaCart
traffic such that the sum of all travel times—the total latency—is minimized. In many settings, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, we assume that each network user routes
Results 1  10
of
533,920