نتایج جستجو برای: organizational communication can be easier

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

2003
Linda M. Gallant Gloria M. Boone

As mobile communication becomes more pervasive, there is an increasing need to study the potential uses of wireless organizational communication. The difficulty in analyzing information and communication technology (ICT) in organizational communication is the unintentional split between information processes perspectives and human communication perspectives in the discussions of workplace techn...

2005
Sara Kiesler Timothy W. McGuire

As more and more people use computers for communicating, the behavioral and societal effects of computer-mediated communication are becoming critical research topics. This article describes some of the issues raised by electronic communication, illustrates one empirical approach for investigating its social psychological effects, and discusses why social psychological research might contribute ...

Journal: :Nuclear Physics B - Proceedings Supplements 2000

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس - دانشکده مهندسی صنایع 1387

according to webster and wind (1972) and anderson et al (1987), “organizational buying is a complex process and involves many people from different functional areas, multiple goals and potentially conflicting decision criteria. moreover, the customers of today are also more knowledgeable and selective when making their purchasing decisions. since a key to organizational survival is the retentio...

2005
William R. Nichols

Social network models can help explain how and why some organizational structures and practices work. Moreover, network analysis is accessible to engineering practitioners and is particularly effective in helping us understand the value of Team Software Process (TSP). Networks not only offer an explanation of how TSP works with respect to communication, but also suggest that as we scale beyond ...

Journal: :Discrete Mathematics 2007
Michel Habib David Kelly Emmanuelle Lebhar Christophe Paul

A graph G s = (V , E s) is a sandwich for a pair of graphs G t = (V , E t) and G = (V , E) if E t ⊆ E s ⊆ E. A sandwich problem asks for the existence of a sandwich graph having an expected property. In a seminal paper, Golumbic et al. [Graph sandwich problems, J. Algorithms 19 (1995) 449–473] present many results on sub-families of perfect graphs. We are especially interested in comparability ...

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

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