Breadth of external knowledge search in service sectors

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Depth and breadth of external knowledge search and performance: The mediating role of absorptive capacity

a r t i c l e i n f o Nowadays it is commonly accepted that exploiting external knowledge sources is important for firms' innovation and performance. However, it is still not clear how this effect takes place and what internal capabilities are involved in the process. We propose to open the black box between external knowledge search strategies, and innovation and performance by proposing absor...

متن کامل

On Dynamic Breadth-First Search in External-Memory

We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monotone update sequences of either Θ(n) edge insertions or Θ(n) edge deletions, we prove an amortized high-probability bound of O(n/B + sort(n) · log B) I/Os per update. In contrast, the currently best approach for static...

متن کامل

External-Memory Breadth-First Search with Sublinear I/O

Breadth-first search (BFS) is a basic graph exploration technique. We give the first external memory algorithm for sparse undirected graphs with sublinear I/O. The best previous algorithm requires (n + n+m D B logM=B n+m B ) I/Os on a graph with n nodes and m edges and a machine with main-memory of sizeM ,D parallel disks, and block size B. We present a new approach which requires only O(qn (n+...

متن کامل

Breadth-First Heuristic Search

Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-c...

متن کامل

The breadth of memory search.

The recall of previously studied items is widely believed to incorporate a search of a markedly constrained set of possibilities, and the present study examines whether this set of items typically includes unstudied semantic associates of the study items. In an episodic task, participants recalled a previously studied list of eight exemplars drawn from a small or large category, and, in a seman...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Business Process Management Journal

سال: 2020

ISSN: 1463-7154

DOI: 10.1108/bpmj-01-2020-0018