نتایج جستجو برای: pairwise constraints

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

2010
Aaron K. Massey Annie I. Antón

The high cost of non-compliance with laws and regulations that govern software systems makes legal requirements prioritization crucial. In addition, software design, expense, and time constraints all influence how requirements are prioritized. Prioritizing requirements derived from laws and regulations can be untenable using traditional pairwise requirements prioritization techniques because th...

2009
Vineet Kahlon

The problem of Pairwise CFL-reachability is to decide whether two given program locations in different threads are simultaneously reachable in the presence of recursion in threads and scheduling constraints imposed by synchronization primitives. Pairwise CFL-reachability is the core problem underlying concurrent program analysis especially dataflow analysis. Unfortunately, it is undecidable eve...

1996
Benoit Huet Edwin R. Hancock

This paper aims to develop simple statistical methods for indexing line patterns. The application vehicle used in this study involves indexing into an aerial image database using a cartographic model. The images contained in the database are of urban and semi-urban areas. The cartographic model represents a road network known to appear in a subset of the images contained within the database. Th...

2000
Salam A. Zummo Saud A. Al-Semari

This paper presents the performance of Space-Time (ST) codes over rapid fading channels. A tight upper bound on the pairwise error probability (PWEP) of ST codes over rapid fading channels is derived. Also, an upper bound on the bit error probability (BEP) is evaluated using the derived PWEP. The existing and new bounds are evaluated for different QPSK ST codes and compared to the simulation re...

Journal: :bulletin of the iranian mathematical society 2013
a. kilicman z. salleh

in the present paper we introduce and study the notion of pairwise weakly lindelof bitopological spaces and obtain some results. further, we also study the pairwise weakly lindelof subspaces and subsets, and investigate some of their properties. it was proved that a pairwise weakly lindelof property is not a hereditary property.

Journal: :مدیریت اطلاعات سلامت 0
محمد جبرائیلی مربی، مدارک پزشکی، دانشگاه علوم پزشکی ارومیه، ارومیه، ایران زکیه پیری استادیار، مدیریت اطلاعات سلامت، دانشگاه علوم پزشکی تبریز، تبریز، ایران. بهلول رحیمی استادیار، انفورماتیک پزشکی، دانشگاه علوم پزشکی ارومیه، ارومیه، ایران نازآفرین قاسم زاده دانشجوی دکتری، اخلاق پزشکی، دانشگاه علوم پزشکی تهران، تهران، ایران. محمد قاسمی راد دانشجو، پزشکی عمومی، دانشگاه علوم پزشکی ارومیه، ارومیه، ایران. آیت محمودی دانشجو، پزشکی عمومی، دانشگاه علوم پزشکی ارومیه، ارومیه، ایران.

introduction: the critical dependence of healthcare services systems on information along with the indigenous restriction of paper documents in satisfying this need has caused a trend toward computer information systems. the main goal of such systems is to achieve electronic health records (ehr). however, implementation of ehr in healthcare organizations is difficult and complicated. this resea...

Journal: :Int. J. Comput. Geometry Appl. 2007
Mireille Boutin Gregor Kemper

In a previous paper we showed that, for any , most sets of points in are determined (up to rotations, reflections, translations and relabeling of the points) by the distribution of their pairwise distances. But there are some exceptional point configurations which are not reconstructible from the distribution of distances in the above sense. In this paper, we concentrate on the planar case and ...

Journal: :IEEE Trans. Communications 2002
Jürgen Häring A. J. Han Vinck

The transmission over the memoryless additive white Class-A noise (AWCN) channel is considered. For uncoded transmission, an exact expression for the symbol error rate is derived. For coded transmission, the Chernoff bound on the pairwise error probability is calculated and the performance achieved on the real and the complex AWCN channels is compared. Moreover, a lowcomplexity, suboptimum deco...

Journal: :journal of sciences islamic republic of iran 0

in the following work we present a proof for the strong law of large numbers for pairwise negatively dependent random variables which relaxes the usual assumption of pairwise independence. let be a double sequence of pairwise negatively dependent random variables. if for all non-negative real numbers t and , for 1 < p < 2, then we prove that (1). in addition, it also converges to 0 in . the res...

Journal: :European Journal of Operational Research 2016
Michel Gendreau Daniele Manerba Renata Mansini

In this work we study a suppliers selection and routing problem where a fleet of homogeneous vehicles with a predefined capacity is available for procuring different products from different suppliers with the aim to minimize both the traveling and the purchasing costs. Decisions are further complicated by the presence of pairwise incompatibility constraints among products, implying the impossib...

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

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