نتایج جستجو برای: dilloutput and inputenergy efficiency

تعداد نتایج: 16866305  

2009
Krzysztof R. Apt Evangelos Markakis

We are interested in mechanisms that maximize social welfare. In [2] this problem was studied for multi-unit auctions and for public project problems, and in each case social welfare undominated mechanisms were identified. One way to improve upon these optimality results is by allowing the players to move sequentially. With this in mind, we study here a sequential version of the Bailey-Cavallo ...

Journal: :J. Global Optimization 2015
Julius Zilinskas Boris Goldengorin Panos M. Pardalos

The earliest approaches to the cell formation problem in group technology, dealing with a binary machine-part incidence matrix, were aimed only at minimizing the number of intercell moves (exceptional elements in the block-diagonalized matrix). Later on this goal was extended to simultaneous minimization of the numbers of exceptions and voids, and minimization of intercell moves and within-cell...

2003
Eric Malin David Martimort

This paper tries to reconcile incentive theory with transaction costs theory. We first discuss the fundamental assumptions underlying the use of the Revelation Principle in the standard mechanism design literature and show how various contractual incompletenesses and externalities induced by transaction costs affect the basic trade-off between allocative efficiency and informational rents highl...

2002
Pradeep Dubey John Geanakoplos Martin Shubik

We extend the standard model of general equilibrium with incomplete markets to allow for default and punishment. The equilibrating variables include expected delivery rates, along with the usual prices of assets and commodities. By reinterpreting the variables, our model encompasses a broad range of adverse selection and signalling phenomena (including the Akerlof lemons model and the Rothschil...

2012
X. Lladó Y. Díez

msj.sagepub.com Multiple Sclerosis Journal 2012; 18: (S4) 55–277 P398 A supervised approach to segment multiple sclerosis lesions using context-rich features and a boosting classifier M. Cabezas, A. Oliver, X. Lladó, Y. Díez, J. Freixenet, J.C. Vilanova, A. Quiles, G. Laguillo, L. Ramió-Torrentà, D. Pareto, A. Rovira University of Girona (Girona, ES); Girona Magnetic Resonance Center (Girona, E...

Journal: :CoRR 2009
Dmitry Zinoviev Vy Duong

All major on-line social networks, such as MySpace, Facebook, LiveJournal, and Orkut, are built around the concept of friendship. It is not uncommon for a social network participant to have over 100 friends. A natural question arises: are they all real friends of hers, or does she mean something different when she calls them “friends?” Speaking in other words, what is the relationship between o...

2006
Alex Loscos Ye Wang Wei Jie Jonathan Boo

On top of previous work in automatic violin transcription we present a set of straight forward low level descriptors for assisting the transcription techniques and saving computational cost. Proposed descriptors have been tested against a database of 1500 violin notes and double stops.

2003
Jeroen Lichtenauer Iwan Setyawan Ton Kalker Reginald L. Lagendijk

One way of recovering watermarks in geometrically distorted images is by performing a geometrical search. In addition to the computational cost required for this method, this paper considers the more important problem of false positives. The maximal number of detections that can be performed in a geometrical search is bounded by the maximum false positive detection probability required by the w...

2002
PHILIPPE SALEMBIER JAVIER RUIZ

This paper deals with connected operators based on reconstruction process. New operators are proposed to perform size and motion simplification. In the case of size simplification, the proposed approach allows to better preserve the contrast of maxima or minima that have not been totally simplified by the filtering process. In the case of motion simplification, two applications are illustrated:...

2013
Jianguo Jiang Qian Su Ming Li Mengnan Liu Liyuan Zhang

In order to overcome the defects of Shuffled Frog Leaping Algorithm (SFLA) such as nonuniform initial population, slow searching speed in the late evolution and easily trapping into local extremum, a new Shuffled Frog Leaping Algorithm based on mutation operator and population diversity is proposed in this paper. The algorithm has overcome the disadvantage mentioned above. The algorithm efficie...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید