Results 1 - 10 of 52,587

Minimizing total costs of forest roads with computer-aided design model

by Abdullah E Akay - Sadhana , 2006
"... Abstract. Advances in personal computers (PCs) have increased interest in computer-based road-design systems to provide rapid evaluation of alternative alignments. Optimization techniques can provide road managers with a powerful tool that searches for large numbers of alternative alignments in shor ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
in short spans of time. A forest road optimization model, integrated with two optimization techniques, was developed to help a forest road engineer in evaluating alternative alignments in a faster and more systematic manner. The model aims at designing a path with min-imum total road costs, while

An Artificial Immune Algorithm for Minimizing Total Cost of Resources in the Resource Constrained Project Scheduling Problem

by Ramin Golestaneh, Azizollah Jafari, Ramin Golestaneh, Hossein Karimi, Azizollah Jafari, Mohammad Khalilzadeh , 2013
"... Abstract — In this article, an Artificial Immune Algorithm (AIA) for minimizing total costs of both renewable and non-renewable resources in the Resource-Constrained Project Scheduling Problem (RCPSP) is presented. We assume renewable resources that are limited in number, are restricted to very expe ..."
Abstract - Add to MetaCart
Abstract — In this article, an Artificial Immune Algorithm (AIA) for minimizing total costs of both renewable and non-renewable resources in the Resource-Constrained Project Scheduling Problem (RCPSP) is presented. We assume renewable resources that are limited in number, are restricted to very

An Algorithm for Total Variation Minimization and Applications

by Antonin Chambolle , 2004
"... We propose an algorithm for minimizing the total variation of an image, and provide a proof of convergence. We show applications to image denoising, zooming, and the computation of the mean curvature motion of interfaces. ..."
Abstract - Cited by 624 (8 self) - Add to MetaCart
We propose an algorithm for minimizing the total variation of an image, and provide a proof of convergence. We show applications to image denoising, zooming, and the computation of the mean curvature motion of interfaces.

Nonlinear total variation based noise removal algorithms

by Leonid I. Rudin, Stanley Osher, Emad Fatemi , 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract - Cited by 2271 (51 self) - Add to MetaCart
A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using

How bad is selfish routing?

by Tim Roughgarden, Éva Tardos - 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
its traffic on the minimum-latency path available to it, given the network congestion caused by the other users. In general such a “selfishly motivated ” assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance

Financial Intermediation and Delegated Monitoring

by Douglas W. Diamond - Review of Economic Studies , 1984
"... This paper develops a theory of financial intermediation based on minimizing the cost of monitoring information which is useful for resolving incentive problems between borrowers and lenders. It presents a characterization of the costs of providing incentives for delegated monitoring by a financial ..."
Abstract - Cited by 1433 (18 self) - Add to MetaCart
This paper develops a theory of financial intermediation based on minimizing the cost of monitoring information which is useful for resolving incentive problems between borrowers and lenders. It presents a characterization of the costs of providing incentives for delegated monitoring by a financial

Multiparty Communication Complexity

by Danny Dolev, Tomás Feder , 1989
"... A given Boolean function has its input distributed among many parties. The aim is to determine which parties to tMk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. This paper shows that it is possible to obtain the Boo ..."
Abstract - Cited by 760 (22 self) - Add to MetaCart
A given Boolean function has its input distributed among many parties. The aim is to determine which parties to tMk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. This paper shows that it is possible to obtain

Active Messages: a Mechanism for Integrated Communication and Computation

by Thorsten Von Eicken, David E. Culler, Seth Copen Goldstein, Klaus Erik Schauser , 1992
"... The design challenge for large-scale multiprocessors is (1) to minimize communication overhead, (2) allow communication to overlap computation, and (3) coordinate the two without sacrificing processor cost/performance. We show that existing message passing multiprocessors have unnecessarily high com ..."
Abstract - Cited by 1054 (75 self) - Add to MetaCart
The design challenge for large-scale multiprocessors is (1) to minimize communication overhead, (2) allow communication to overlap computation, and (3) coordinate the two without sacrificing processor cost/performance. We show that existing message passing multiprocessors have unnecessarily high

A High-Throughput Path Metric for Multi-Hop Wireless Routing

by Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris , 2003
"... This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract - Cited by 1108 (5 self) - Add to MetaCart
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination

Nonrigid registration using free-form deformations: Application to breast MR images

by D. Rueckert, L. I. Sonoda, C. Hayes, D. L. G. Hill, M. O. Leach, D. J. Hawkes - IEEE Transactions on Medical Imaging , 1999
"... Abstract — In this paper we present a new approach for the nonrigid registration of contrast-enhanced breast MRI. A hierarchical transformation model of the motion of the breast has been developed. The global motion of the breast is modeled by an affine transformation while the local breast motion i ..."
Abstract - Cited by 697 (36 self) - Add to MetaCart
is described by a free-form deformation (FFD) based on B-splines. Normalized mutual information is used as a voxel-based similarity measure which is insensitive to intensity changes as a result of the contrast enhancement. Registration is achieved by minimizing a cost function, which represents a combination
Results 1 - 10 of 52,587