Search
Now showing items 11-20 of 74
A computational study of lower bounds for the two dimensional bin packing problem
(Elsevier, 2010-08-01)
We survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al. between their lower bounds and those of Boschetti ...
INTERSPEECH 2009 duygu tanıma yarışması değerlendirmesi
(IEEE, 2010)
Bu makalede INTERSPEECH 2009 Duygu Tanıma Yarışması sonuçlarını değerlendiriyoruz. Yarışmanın sunduğu problem doğal ve duygu bakımından zengin FAU Aibo konuşma kayıtlarının beş ve iki duygu sınıfına en doğru şekilde ...
Use of line spectral frequencies for emotion recognition from speech
(IEEE, 2010)
We propose the use of the line spectral frequency (LSF) features for emotion recognition from speech, which have not been been previously employed for emotion recognition to the best of our knowledge. Spectral features ...
Generalized maximum-likelihood sequence detection for photon-counting free space optical systems
(IEEE, 2010-12)
We investigate detection methods for on-off keying (OOK) photon-counting Free Space Optical (FSO) systems in the presence of turbulence-induced fading, assuming no channel state information at the receiver. To recover the ...
Rekabet avantajı kuramının tanımlanması ve ölçümlenmesi
(Marmara Üniversitesi, 2010)
Üstün performans elde etmek için, rakiplere karşı sürdürülebilir avantajlara sahip olmak prensibi günümüz strateji düşüncesinin temelini oluşturmaktadır. Ancak, bu avantajların neler olması gerektiği konusunda sınırlı ve ...
Robust aircraft routing and flight retiming
(Elsevier, 2010-08-01)
In this paper, we propose an integrated model for the robust aircraft routing and flight retiming problem. The model optimizes a slack-based robustness measure that explicitly takes heed of passengers in connection and ...
Dynamic FEC algorithms for TFRC flows
(IEEE, 2010-12)
Media flows coexist with TCP-based data traffic on the Internet and are required to be TCP-friendly. The TCP protocol slowly increases its sending rate until episodes of congestion occur, and then it quickly reduces its ...
Strength of three MIP formulations for the prize collecting steiner tree problem with a quota constraint
(Elsevier, 2010-08-01)
This paper investigates the quota version of the Prize Collecting Steiner Tree Problem (PCSTP) on a graph as a generalization of the well-known Steiner tree problem. For this challenging network design problem that arises ...
Axial charges of octet baryons in two-flavor lattice QCD
(Elsevier, 2010-03-15)
We evaluate the strangeness-conserving NN, ΣΣ, ΞΞ, ΛΣ and the strangeness-changing ΛN, ΣN, ΛΞ, ΣΞ axial charges in lattice QCD with two flavors of dynamical quarks and extend our previous work on pseudoscalar-meson–octet-baryon ...
The one-warehouse multiretailer problem with an order-up-to level inventory policy
(Wiley, 2010-10)
We consider a two-level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order-up-to level inventory policy over T periods and faces an external demand which is dynamic ...
Share this page