Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
9,346
CONDITIONS FOR AN EFFICIENT INNOVATION PROCESS IMPLEMENTATION OF SUGGESTION SCHEMES
"... www.iaaeg.de The specific and tacit knowledge of shopfloor employees are a vital source for innovative work behaviour. Firms can use these skills to increase the efficiency of process innovation in the stages of idea generation and implementation of new processes. This study examines the necessary c ..."
Abstract
- Add to MetaCart
specific knowledge. I use the “Changing Employment Relationships ” survey to test for the complementary relationship between a set of human resource practices and the existence of a suggestion scheme. The results confirm that organizations which provide the framework for their employees to acquire
A comparative analysis of selection schemes used in genetic algorithms
- Foundations of Genetic Algorithms
, 1991
"... This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or d ..."
Abstract
-
Cited by 531 (31 self)
- Add to MetaCart
This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference
Analysis and Simulation of a Fair Queueing Algorithm
, 1989
"... We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. A fair queueing algorithm, based on an earlier suggestion by Nagle, is proposed. Analysis and simulations are used to compare this algorithm to other congestion control schemes. We find. that fair q ..."
Abstract
-
Cited by 1269 (39 self)
- Add to MetaCart
We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. A fair queueing algorithm, based on an earlier suggestion by Nagle, is proposed. Analysis and simulations are used to compare this algorithm to other congestion control schemes. We find. that fair
Cognitive load during problem solving: effects on learning
- COGNITIVE SCIENCE
, 1988
"... Considerable evidence indicates that domain specific knowledge in the form of schemes is the primary factor distinguishing experts from novices in problem-solving skill. Evidence that conventional problem-solving activity is not effective in schema acquisition is also accumulating. It is suggested t ..."
Abstract
-
Cited by 639 (13 self)
- Add to MetaCart
Considerable evidence indicates that domain specific knowledge in the form of schemes is the primary factor distinguishing experts from novices in problem-solving skill. Evidence that conventional problem-solving activity is not effective in schema acquisition is also accumulating. It is suggested
Relations between the statistics of natural images and the response properties of cortical cells
- J. Opt. Soc. Am. A
, 1987
"... The relative efficiency of any particular image-coding scheme should be defined only in relation to the class of images that the code is likely to encounter. To understand the representation of images by the mammalian visual system, it might therefore be useful to consider the statistics of images f ..."
Abstract
-
Cited by 831 (18 self)
- Add to MetaCart
The relative efficiency of any particular image-coding scheme should be defined only in relation to the class of images that the code is likely to encounter. To understand the representation of images by the mammalian visual system, it might therefore be useful to consider the statistics of images
Similarity search in high dimensions via hashing
, 1999
"... The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building search/index structures for performing similarity search over high-dimensional data, e.g., image dat ..."
Abstract
-
Cited by 641 (10 self)
- Add to MetaCart
to 20, searching in k-d trees and related structures involves the inspection of a large fraction of the database, thereby doing no better than brute-force linear search. It has been suggested that since the selection of features and the choice of a distance metric in typical applications is rather
Combining Branch Predictors
, 1993
"... One of the key factors determining computer performance is the degree to which the implementation can take advantage of instruction-level paral-lelism. Perhaps the most critical limit to this parallelism is the presence of conditional branches that determine which instructions need to be executed ne ..."
Abstract
-
Cited by 629 (0 self)
- Add to MetaCart
next. To increase parallelism, several authors have suggested ways of predicting the direction of conditional branches with hardware that uses the history of previous branches. The different proposed predictors take advan-tage of different observed patterns in branch behavior. This paper presents a
Efficient Implementation of Weighted ENO Schemes
, 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially non-oscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract
-
Cited by 412 (38 self)
- Add to MetaCart
th order WENO scheme is as fast as the 4 th order WENO scheme of Liu et al. and, both schemes are about twice as fast as the 4th order ENO schemes on vector supercomputers and as fast on serial and parallel computers. For Euler systems of gas dynamics, we suggest to compute the weights from pressure
Random Early Detection Gateways for Congestion Avoidance.
- IEEELACM Transactions on Networking,
, 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract
-
Cited by 2716 (31 self)
- Add to MetaCart
connections and reducing delay for a particular connection during its periods of burstiness [4], but it scales well and is easy to implement efficiently. In an alternate approach, some congestion control mechanisms that use variants of Fair Queueing [20] or hop-by-hop flow control schemes [22] propose
Loopy belief propagation for approximate inference: An empirical study. In:
- Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract
-
Cited by 676 (15 self)
- Add to MetaCart
-limit performance of "Turbo Codes" -codes whose decoding algorithm is equivalent to loopy belief propagation in a chain-structured Bayesian network. In this paper we ask: is there something spe cial about the error-correcting code context, or does loopy propagation work as an ap proximate inference scheme
Results 1 - 10
of
9,346
