Results 1  10
of
111
4Block Heuristic for the Rectangle Packing Problem
 European Journal of Operational Research
, 1996
"... In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4heuristic for the pallet loading p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4heuristic for the pallet loading
What makes an insight problem? the roles of heuristics, goal conception, and solution recoding in knowledgelean problems
 Journal of Experimental Psychology: Learning, Memory and Cognition
, 2004
"... Four experiments investigated transformation problems with insight characteristics. In Experiment 1, performance on a version of the 6coin problem that had a concrete and visualizable solution followed a hillclimbing heuristic. Experiment 2 demonstrated that the difficulty of a version of the prob ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
of the problem that potentially required insight for solution stems from the same hillclimbing heuristic, which creates an implicit conceptual block. Experiment 3 confirmed that the difficulty of the potential insight solution is conceptual, not procedural. Experiment 4 demonstrated the same principles of move
Getting at the truth or getting along: Accuracyversus impressionmotivated heuristic and systematic processing
"... The choice between novelty and familiarity when introducing a redesigned product is a crucial decision. A look into the processes of object perception reveals that novelty and similarity/familiarity are not two poles of the same dimension. Instead it is possible that consumers can perceive new prod ..."
Abstract
 Add to MetaCart
products as both novel from and similar to a former product. Based on the 4stage model of object perception this paper provides an explanation of how specific visual design stimuli (line and surface) affect brand recognition and novelty perception. Results from experimental studies are presented. [to cite
Concepts of Exact QoS Routing Algorithms
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2004
"... Algorithm are explained. We show that these four concepts, namely 1) nonlinear definition of the path length; 2) ashortest path approach; 3) nondominance; and 4) lookahead, are fundamental building blocks of a multiconstrained routing algorithm. The main reasons to consider exact multiconstrained ..."
Abstract

Cited by 43 (1 self)
 Add to MetaCart
Algorithm are explained. We show that these four concepts, namely 1) nonlinear definition of the path length; 2) ashortest path approach; 3) nondominance; and 4) lookahead, are fundamental building blocks of a multiconstrained routing algorithm. The main reasons to consider exact multiconstrained
Art of Constructing LowComplexity Encoders/Decoders for Constrained Block Codes
 IEEE J. Select. Areas Commun
, 2001
"... A rate : block encoder is a datawordtocodeword assignment from bit datawords to bit codewords, and the corresponding block decoder is the inverse of the encoder. When designing block encoders/decoders for constrained systems, often, more than codewords are available. In this paper, as ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
, as our main contribution, we propose efficient heuristic computer algorithms to eliminate the excess codewords and to construct low hardware complexity block encoders/decoders. For (0, 4/4) and (0, 3/6) PRML constraints, block encoders/decoders generated using the proposed algorithms are comparable
The central question in entrepreneurial cognition research 2007. Entrepreneurship Theory and Practice,
, 2007
"... In this article, we take note of advances in the entrepreneurial cognition research stream. In doing so, we bring increasing attention to the usefulness of entrepreneurial cognition research. First, we offer and develop a central research question to further enable entrepreneurial cognition inquiry ..."
Abstract

Cited by 42 (4 self)
 Add to MetaCart
., 2002, p. 97). We note that in this definition, the key elements: knowledge structures (whether heuristical or scripted) and decision making (including assessment and judgment) are set within the larger context of entrepreneurship's distinctive and inclusive domain/situation At the Second
Minimizing Deflection And Bending Moment In A Beam With End Supports
, 2003
"... We give heuristics to sequence blocks on a beam, like books on a bookshelf, to minimize simultaneously the maximum deflection and the maximum bending moment of the beam. For a beam with simple supports at the ends, one heuristic places the blocks so that the maximum deflection is no more than 16 ..."
Abstract
 Add to MetaCart
We give heuristics to sequence blocks on a beam, like books on a bookshelf, to minimize simultaneously the maximum deflection and the maximum bending moment of the beam. For a beam with simple supports at the ends, one heuristic places the blocks so that the maximum deflection is no more than
On the Stability of Pallet Loading Layouts
, 2000
"... The packing layout for loading boxes of identical format on a pallet can be determined algorithmically. This is important when performing automated packing by a robot. The wellknown fourblock heuristics and G4heuristics produce very efficient loading patters in most practical cases. In additio ..."
Abstract
 Add to MetaCart
The packing layout for loading boxes of identical format on a pallet can be determined algorithmically. This is important when performing automated packing by a robot. The wellknown fourblock heuristics and G4heuristics produce very efficient loading patters in most practical cases
On the Complexity of Generating Optimal LeftDeep Processing Trees with Cross Products
 In ICDT Conference
, 1995
"... . Producing optimal leftdeep trees is known to be NPcomplete for general join graphs and a quite complex cost function counting disk accesses for a special blockwise nestedloop join [2]. Independent of any cost function is the dynamic programming approach to join ordering. The number of alternat ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
. Producing optimal leftdeep trees is known to be NPcomplete for general join graphs and a quite complex cost function counting disk accesses for a special blockwise nestedloop join [2]. Independent of any cost function is the dynamic programming approach to join ordering. The number
A decoding of block codes
 IEEE Trans. Comm
, 1996
"... AMTCWL Tho A * algorithm is applied to maximumlikelihood softdecision decoding of binary linear block codes. This pripcr gives a tutorial on the A * algorithm, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
. Nilsson [1] describes the algorithm as a heuristic graphsearch procedure, and shows that the algorithm always terminates in an optimal path. A * has been used to implement full lnaximum likelihood soft decoding of linear block codes by Han, et al, [2], [3], and [4]. Other treesearch algorithms, e
Results 1  10
of
111