Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Greediness

To identify this set of final feasible solutions, X e 1, with low scores, we developed a greedy search procedure, S (Saraiva and Stephanopoulos, 1992c), that has resulted, within an acceptable computation time, in almost-optimal solutions for all the cases studied so far, while avoiding the combinatorial explosion with the number of (x, y) pairs of an exhaustive enumeration/evaluation of all feasible alternatives. The algorithm starts by partitioning the decision space into a number of isovolu-... [Pg.125]

Induction via decision trees is a greedy procedure and does not guarantee optimality of the mapping, but works well in practice, as illustrated by successful applications in several areas. The attractive features of learning by decision trees are listed below. [Pg.264]

He entered, thrusting the door to behind him, and took me in his arms, my smock rumpling under his eager hands, his breath hot on my face. One big hand in the small of my back, one fumbling with his points, and his mouth greedy upon mine. [Pg.156]

We note that, at its simplest, the optimization will be on an epoch by epoch basis (the so-called greedy or myopic approach). In this case, the mode is chosen just to optimize for the next epoch and defer consideration of future behavior. A more sophisticated system would look several epochs ahead in applying the measure of effectiveness, though it would also update the scheduling policy on an epoch by epoch basis. Such an approach is, a priori, very computer intensive, and much work is needed to develop shortcuts to calculation of the optimal policy. Sometimes it may be appropriate to choose to measure the effectiveness of a policy only at the last epoch of application of that policy. [Pg.276]

When in 1764 Giuseppe had been forced to flee from that greedy silversmith Marano, he and his two accomplices, a valet and a priest, headed straight to Messina on the far side of the island. They couldn t stay long— the arm of the law would soon have reached them—but they could cadge a few days of hospitality from Giuseppes well-to-do uncle, Joseph Cagliostro. [Pg.29]

The active site in either the ready or unready state can accept one electron, as demonstrated with redox titrations (see Chapter 5). Since O2 is a very greedy electron acceptor, one must take care that it is absent. Usually, redox titrations are reversible (even at 2°C), but the reduction of the A. vinosum enzyme in the ready state is irreversible at 2°C. We have shown that a reversible redox titration of the ready state is only obtained at elevated temperatures (>30°C). We do not yet understand the reason for these differences in behaviour of ready and unready enzyme. [Pg.139]

Trevor M. Benson, Svetlana V. Boriskina, Phillip Sewell, Ana Vukovic, Stephen C. Greedy and Alexander I. Nosich ... [Pg.39]

Figure 10. Field distributions for two WG modes in a microdisk resonator on a substrate predicted by the Spectral Index method (Greedy, 2000). Figure 10. Field distributions for two WG modes in a microdisk resonator on a substrate predicted by the Spectral Index method (Greedy, 2000).
Greedy, S.C., Boriskina, S.V., Sewell, P., Benson, T.M., 2001, Design and simulation tools for optical micro-resonators, Proc. Photonics West Conference, San Jose, CA. [Pg.65]

Apply as a topdressing to greedy feeders such as sguash and other fruiting vegetables during the growing season. [Pg.48]

Brandy (325) suggests that the father can be considered a greedy phiHstine for being both a lawyer and an alchemist. [Pg.193]

The second approach leaves the data fixed, and introduces a random element into the selection of the splitting variable. So if, for example, predictors x29, x47, and x82 were the only significant splitters and had multiplicity-adjusted p values of say 2 x 10-7, 5 x 10-8, and 3 x 10-3, the conventional greedy algorithm would pick x47 as the splitting variable as it was the most significant. The RRP procedure would pick one of these three at random. Repeating the analysis with fresh random choices would then lead to a forest of trees different random choices will create different trees. [Pg.325]

First, consider efficiency. Many people incorrectly assume that, in the absence of codes, consumers would be helpless against greedy firms. But without codes, builders would compete on the basis of safety and features, and consumers could hire inspectors to evaluate structural quality (which already happens during mortgage inspections). Builders could also hire firms to certify that their structures comply with best practice (the construction equivalent of Underwriters Laboratories). Uncertified builders would be at a quality disadvantage. [Pg.44]


See other pages where Greediness is mentioned: [Pg.176]    [Pg.164]    [Pg.185]    [Pg.807]    [Pg.78]    [Pg.167]    [Pg.20]    [Pg.286]    [Pg.142]    [Pg.149]    [Pg.170]    [Pg.105]    [Pg.258]    [Pg.203]    [Pg.117]    [Pg.119]    [Pg.17]    [Pg.105]    [Pg.218]    [Pg.251]    [Pg.57]    [Pg.59]    [Pg.69]    [Pg.86]    [Pg.186]    [Pg.39]    [Pg.209]    [Pg.13]    [Pg.186]    [Pg.194]    [Pg.325]    [Pg.327]    [Pg.360]    [Pg.20]    [Pg.43]    [Pg.68]    [Pg.137]   
See also in sourсe #XX -- [ Pg.88 , Pg.99 ]




SEARCH



Greedy Algorithm for Aggregate Planning

Greedy Algorithms for Pairwise Alignment

Greedy algorithm

Greedy approach

Greedy heuristic

Greedy search

© 2024 chempedia.info