نتایج جستجو برای: boundary spanning

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

2010
Alan Fisk Nicholas Berente Kalle Lyytinen

Information System Development (ISD) relies on cross-functional teams with distinct cultures and nonoverlapping knowledge. Developing a shared understanding of the business needs and associated IS solutions by drawing upon these disparate knowledge sets is critical for project success. We adopt a “practice” view of system development, which emphasizes the relevance of knowledge boundaries betwe...

Journal: :The Journal of High Technology Management Research 1990

Journal: :Architectural Engineering and Design Management 2020

Journal: :Engaged scholar journal 2021

The purpose of this study was to explore faculty members’ perceptions their roles as boundary spanners, the expectations they have for professional competencies related spanning, and how these were prepared successfully perform in boundary-spanning leadership roles. In context higher education community engagement, spanning refers work that is critical overcoming divide between institution (Wee...

Journal: :Journal of Management Studies 2022

Intergroup knowledge integration, that is the acquisition, processing, and utilization of across group boundaries, a critical source competitive advantage in modern organizations. Prior research has highlighted important role boundary spanning exchange for intergroup neglecting, however, question what makes individual spanners more effective fostering integration. Integrating literature with th...

2003

CAREER: DISTRIBUTED COOPERATION IN BOUNDARY-SPANNING IS DESIGN Project Summary The IT component of information system development has been radically simplified in recent years. Many corporations are now attempting to jointly design business processes and IT systems, to integrate workflows and information flows across business processes. The majority of these efforts fail, because there is a fun...

2015
Sergei Chmutov

The Krushkal polynomial is the most general polynomial invariant of graphs on surfaces. It was introduced in [1]. A collection of edges forms a spanning quasi-tree if the regular neighborhood of the corresponding spanning subgraph has one boundary component. In the case of plane graphs it is just a spanning tree. The set of edges of a spanning quasi-trees is a feasible set of the corresponding ...

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

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