Preference-based Search and Multi-criteria Optimization
|
|
- Caitlin Andrews
- 8 years ago
- Views:
Transcription
1 Fro: AAAI-02 Proceedings. Copyright 2002, AAAI ( All rights reserved. Preference-based Search and Multi-criteria Optiization Ulrich Junker ILOG 1681, route des Dolines F Valbonne Abstract Many real-world AI probles (e.g. in configuration) are weakly constrained, thus requiring a echanis for characterizing and finding the preferred solutions. Preferencebased search (PBS) exploits preferences between decisions to focus search to preferred solutions, but does not efficiently treat preferences on defined criteria such as the total price or quality of a configuration. We generalize PBS to copute balanced, extree, and Pareto-optial solutions for general CSP s, thus handling preferences on and between ultiple criteria. A aster-pbs selects criteria based on trade-offs and preferences and passes the as optiization objective to a sub-pbs that perfors a constraint-based Branch-and-Bound search. We project the preferences of the selected criterion to the search decisions to provide a search heuristics and to reduce search effort, thus giving the criterion a high ipact on the search. The resulting ethod will particularly be effective for CSP s with large doains that arise if configuration catalogs are large. Keywords: preferences, nononotonic reasoning, constraint satisfaction, ulti-criteria optiization, search. Introduction In this paper, we consider cobinatorial probles that are weakly constrained and that lack a clear global optiization objective. Many real-world AI probles have these characteristics: exaples can be found in configuration, design, diagnosis, but also in teporal reasoning and scheduling. An exaple for configuration is a vacation adviser syste that chooses vacation destinations fro a potentially very large catalog. Given user requireents (e.g. about desired vacation activities such as wind-surfing, canyoning), copatibility constraints between different destinations, and global resource constraints (e.g. on price) usually still leave a large set of possible solutions. In spite of this, ost of the solutions will be discarded as long as ore interesting solutions are possible. Preferences on different choices and criteria are an adequate way to characterize the interesting solutions. For exaple, the user ay prefer Hawaii to Florida for doing wind-surfing or prefer cheaper vacations in general. Different ethods for representing and treating preferences have been developed in different disciplines. In AI, Copyright c 2002, Aerican Association for Artificial Intelligence ( All rights reserved. preferences are often treated in a qualitative way and specify an order between hypotheses, default rules, or decisions. Exaples for this have been elaborated in nononotonic reasoning (Brewka 1989) and constraint satisfaction (Junker 2000). Here, preferences can be represented by a predicate or a constraint, which allows coplex preference stateents (e.g. dynaic preferences, soft preferences, etapreferences and so on). Furtherore, preferences between search decisions also allow to express search heuristics and to reduce search effort for certain kinds of scheduling probles (Junker 2000). In our vacation adviser exaple, the basic decisions consist in choosing one (or several) destinations and we can thus express preferences between individual destinations. However, the user preferences are usually forulated on global criteria such as the total price, quality, and distance which are defined in ters of the prices, qualities, and distances of all the chosen destinations. We thus obtain a ulti-criteria optiization proble. We could try to apply the preference-based search (Junker 2000) by choosing the values of the different criteria before choosing the destinations. However, this ethod has severe draw-backs: 1. Choosing the value of a defined criterion highly constrains the reaining search proble and usually leads to a thrashing behaviour. 2. The different criteria are iniized in a strict order. We get solutions that are optial w.r.t. soe lexicographic order, but none that represents coproises between the different criteria. E.g., the syste ay propose a cheap vacation of bad quality and an expensive vacation of good quality, but no coproise between price and quality. Hence, a naive application of preferences between decisions to ulti-criteria optiization probles can lead to thrashing and lacks a balancing echanis. Multi-criteria optiization avoids those proble. In Operations Research, a ulti-criteria optiization proble is usually apped to a single or a sequence of single-criterion optiization probles which are solved by traditional ethods. Furtherore, there are several notions of optiality such as Pareto-optiality, lexicographic optiality, and lexicographic ax-order optiality (Ehrgott 1997). We can thus deterine extree solutions where one criteria is 34 AAAI-02
2 favoured to another criteria as well as balanced solutions where the different criteria are as close together as possible and that represent coproises. This balancing requires that the different criteria are coparable, which is usually achieved by a standardization ethod. Surprisingly, the balancing is not achieved by weighted sus of the different criteria, but by a new lexicographic approach (Ehrgott 1997). In order to find a coproise between a good price and a good quality, Ehrgott first iniizes the axiu between (standardized versions of) price and quality, fixes one of the criteria (e.g. the standardized quality) at the resulting iniu, and then iniizes the other criterion (e.g. the price). In this paper, we will develop a odified version of preference-based search that solves a iniization subproble for finding the best value of a given criterion instead of trying out the different value assignents. Furtherore, we also show how to copute Pareto-optial and balanced solutions with new versions of preference-based search. Multi-criteria optiization as studied in Operations Research also has draw-backs. Qualitative preferences as elaborated in AI can help to address following issues: 1. We would like to state that certain criteria are ore iportant than other criteria without choosing a total ranking of the criteria as required by lexicographic optiality. For exaple, we would like to state a preference between a sall price and a high quality on the one hand and a sall distance on the other hand, but we still would like to get a solution where the price is iniized first and a solution where the quality is axiized first. 2. Multi-criteria optiization specifies preferences on defined criteria, but it does not translates the to preferences between search decisions. In general, it is not evident how to autoatically derive a search heuristics fro the selected optiization objective. Adequate preferences between search decisions provide such a heuristics and also allow to apply preference-based search to reduce the search effort for the subproble. In order to address the first point, we copare the different notions of optial solutions with the different notions of preferred solutions that have been elaborated in nononotonic reasoning. If no preferences between criteria are given, the Pareto-optial solutions correspond to the G-preferred solutions (Grosof 1991; Geffner & Pearl 1992; Junker 1997) and the lexicographic-optial solutions correspond to the B-preferred solutions (Brewka 1989; Junker 1997). Preferences between criteria can easily be taken into account by the latter ethods. For balanced solutions, we present a variant of Ehrgott s definition that respects preferences between criteria as well. The different versions of preference-based search will also respect these additional preferences. We thus obtain a syste where the user can express preferences on the criteria and preferences between the criteria and choose between extree solutions, balanced solutions and Pareto-optial solutions. As entioned above, the new versions of preferencebased search solve a iniization subproble when deterining the best value for a selected criterion. We would like to also use preference-based search for solving the subprobles. However, the preferences are only expressed on the criteria and not on the search decisions. It therefore is a natural idea to project the preferences on the selected criterion to the search decisions. We will introduce a general ethod for preference projection, which we then apply to usual objectives such as su, in, ax, and eleent constraints. It is iportant to note that these projected preferences will change fro one subproble to the other. The projected preferences will be used to guide the search and to reduce search effort. Depending on the projected preferences, copletely different parts of the search space ay be explored and, in particular, the first solution depends on the chosen objective. Search effort can be reduced since the projected preferences preserve Pareto-optiality. We therefore adapt the new preference-based search ethod for Paretooptial solutions for solving the subprobles. The paper is organized as follows: we first introduce different notions of optiality fro ulti-criteria optiization and then extend the to cover preferences between criteria. After this, we develop new versions of preference-based search for coputing the different kinds of preferred solutions. Finally, we introduce preference projection. Preferred Solutions We first introduce different notions of optiality fro ulticriteria optiization and then link the to definitions of preferred solutions fro nononotonic reasoning. Preferences on Criteria Throughout this paper, we consider cobinatorial probles that have the decision variables X := (x 1,...,x ), the criteria Z := (z 1,...,z n ), and the constraints C. Each decision variable x i has a doain D(x i ) fro which its values will be chosen. For exaple, x i ay represent the vacation destination in the i-th of = 3 weeks. The constraints in C have the for C(x 1,...,x ). Each constraint sybol C has an associated relation R C.Inour exaple, there ay be copatibility constraints (e.g., the destinations of two successive vacation destinations ust belong to neighboured countries) and requireents (e.g., at least one destination should allow wind-surfing and at least one should allow useu visits). Each criterion z i has a definition in for of a functional constraint z i := f i (x 1,...,x ) and a doain D(z i ). Exaples for criteria are price, quality, and distance (zone). The price is a su of eleent constraints: price := price(x i ) i=1 The total quality is defined as iniu of the individual qualities and the total distance is the axiu of the individual distances. The individual prices, qualities, and destinations are given by tables such as the catalog in figure 1. A solution S of (C, X ) is a set of assignents {x 1 = v 1,...,x = v } of values fro D(x i ) to each x i such that all constraints in C are satisfied, i.e. (v 1,...,v ) R C for each constraint C(x 1,...,x ) C.Wewrite v S (z i ) for the value f i (v 1,...,v ) of z i in the solution S. AAAI-02 35
3 Destination Price Quality Distance Activities Athens useus, wind-surfing Barcelona useus, wind-surfing Florence useus London useus Munich useus Nice wind-surfing... z 2 S 1 S2 S 3 S4 S 5 S 6 S 7 S 8 z 2 S 1 S 9 S 15 S2 S 10 z 3 =10 S 16 S S 3 11 S 17 z S4 3 =20 S 12 z 3 =30 S S 13 5 S 14 S 6 S 7 S 8 Figure 1: Catalog of a fictive hotel chain Furtherore, we introduce preferences between the different values for a criterion z i and thus specify a ulticriteria optiization proble. Let zi D(z i ) D(z i ) be a strict partial order for each z i.for exaple, we choose < for price and distance and > for quality. We write u v iff u v or u = v. Multiple criteria optiization provides different notions of optiality. The ost well-known exaples are Pareto optiality, lexicographic optiality, and optiality w.r.t. weighted sus. APareto-optial solution S is locally optial. If another solution S is better than S w.r.t. a criterion z j then S is better than S for soe other criterion z k : Definition 1 A solution S of (C, X ) is a Pareto-optial solution of (C, X, Z, zi ) iff there is no other solution S of (C, X ) s.t. v S (z k ) zk v S (z k ) for a k and v S (z i ) zi v S (z i ) for all i. Pareto-optial solutions narrow down the solution space since non-pareto-optial solution do not appear to be acceptable. However, their nuber is usually too large in order to enuerate the all. Figure 2 (left) shows the Paretooptial solutions S 1 to S 8 for the two criteria z 1 and z 2. Fro now on, we suppose that all the zi s are total orders. This siplifies the presentation of definitions and algoriths. A lexicographic solution requires to choose a ranking of the different criteria. We express it by a perutation of the indices: Definition 2 Let π be a perutation of 1,...,n. Let V S (π(z)) := (v S (z π1 ),...,v S (z πn )). A solution S of (C, X ) is an extree solution of (C, X, Z, zi ) iff there is no other solution S of (C, X ) s.t. V S (π(z)) lex V S (π(z)). Different rankings lead to different extree 1 solutions which are all Pareto-optial. In figure 2 (left), we obtain the extree solutions S 1 where z 1 is preferred to z 2 and S 8 where z 2 is preferred to z 1. Extree solutions can be deterined by solving a sequence of single-criterion optiization probles starting with the ost iportant criterion. If we cannot establish a preference order between different criteria then we would like to be able to find coproises between the. Although weighted sus (with equal weights) are often used to achieve those coproises, they do not necessarily produce the ost balanced solutions. If 1 We use the ter extree in the sense that certain criteria have an absolute priority over other criteria. z 1 Figure 2: Pareto-optial solutions for iniization criteria we choose the sae weights for z 1 and z 2,weobtain S 7 as the optial solution. Furtherore, if we slightly increase the weight of z 1 the optial solution jups fro S 7 to S 2. Hence, weighted sus, despite of their frequent use, do not appear a good ethod for balancing. In (Ehrgott 1997), Ehrgott uses lexicographic axorderings to deterine optial solutions. In this approach, values of different criteria need to be coparable. For this purpose, we assue that the preference orders zi of the different criteria are equal to a fixed order D. This usually requires soe scaling or standardization of the different criteria. We also introduce the reverse order D which satisfies z i D z j iff z j D z i. When coparing two solutions S 1 and S 2, the values of the criteria in each solution are first sorted w.r.t. the order D before being copared by a lexicographic order. This can lead to different perutations of the criteria for different solutions. We describe the sorting by a perutation ρ S that depends on a given solution S and that satisfies two conditions: 1. ρ S sorts the criteria in a decreasing order: if v S (z i ) D v S (z j ) then ρ S i <ρ S j. 2. ρ S does not change the order if two criteria have the sae value: if i<jand v S (z i )=v S (z j ) then ρ S i <ρ S j. Definition 3 A solution S of (C, X ) is a balanced solution of (C, X, Z, D ) iff there is no other solution S of (C, X ) s.t. V S (ρ S (Z)) lex V S (ρ S (Z)). Balanced solutions are Pareto-optial and they are those Pareto-optial solutions where the different criteria are as close together as possible. In the exaple of figure 2 (left), we obtain S 5 as balanced solution. According to Ehrgott, it can be deterined as follows: first ax(z 1,z 2 ) is iniized. If is the resulting optiu, the constraint ax(z 1,z 2 )= is added before in(z 1,z 2 ) is iniized. Balanced solutions can thus be deterined by solving a sequence of single-criterion optiization probles. Preferences between Criteria If any criteria are given it is natural to specify preferences between different criteria as well. For exaple, we would like to specify that a (sall) price is ore iportant than a (short) distance without specifying anything about the quality. We therefore introduce preferences between criteria in for of a strict partial order Z Z Z. z 1 36 AAAI-02
4 Preferences on criteria and between criteria can be aggregated to preferences between assignents of the for z i = v. Let be the sallest relation satisfying following two conditions: 1. If u zi v then (z i = u) (z i = v) for all u, v and 2. If z i Z z j then (z i = u) (z j = v) for all u, v. Hence, if a criteria z i is ore iportant than z j then any assignent to z i is ore iportant than any assignent to z j. In general, we could also have preferences between individual value assignents of different criteria. In this paper, we siplified the structure of the preferences in order to keep the presentation siple. In nononotonic reasoning, those preferences between assignents can be used in two different ways: 1. as specification of a preference order between solutions. 2. as (incoplete) specification of a total order (or ranking) between all assignents, which is in turn used to define a lexicographic order between solutions. The ceteris-paribus preferences (Boutilier et al. 1997) and the G-preferred solutions of (Grosof 1991; Geffner & Pearl 1992) follow the first approach, whereas the second approach leads to the B-preferred solutions of (Brewka 1989; Junker 1997). We adapt the definitions in (Junker 1997) to the specific preference structure of this paper: Definition 4 A solution S of (C, X ) is a G-preferred solution of (C, X, Z, ) if there is no other solution S of (C, X ) such that v S (z k ) v S (z k ) for soe k and for all i with v S (z i ) zi v S (z i ) there exists a j s.t. z j Z z i and v S (z j ) zj v S (z j ). Hence, a criterion can becoe worse if a ore iportant criterion is iproved. In figure 2 (right), S 1 to S 8 are G- preferred if z 1 Z z 3 and z 2 Z z 3 are given. Each G- preferred solution corresponds to a Pareto-optial solution. If there are no preferences between criteria, each Paretooptial solution corresponds to soe G-preferred solution. However, if there are preferences between criteria, certain Pareto-optial solutions S are not G-preferred. There can be a G-preferred solution S that is better than S for a criterion z i,but worse for a less iportant criterion z j (i.e. z i Z z j ). In general, we ay get new G-preferred solutions if we add new constraints to our proble. However, adding upper bounds on criteria does not add new G-preferred solutions: Proposition 1 S is a G-preferred solution of (C {z i zi u}, X, Z, ) iff S is a G-preferred solution of (C, X, Z, ) and v S (z i ) zi u. Although this property appears to be trivial it is not satisfied for the B-preferred solutions which will be introduced next. It will be essential for coputing G-preferred solutions. In the definition of lexicographic optial solutions, a single ranking of the given criteria is considered. In the definition of B-preferred solutions, we consider all rankings that respect the given preferences between the criteria. Following definition has been adapted fro (Brewka 1989; Junker 1997) to our specific preference structure: Definition 5 A solution S of (C, X ) is a B-preferred solution of (C, X, Z, ) if there exists a perutation π such that 1. π respects Z (i.e. z i Z z j iplies π i < π j ) and 2. there is no other solution S of (C, X ) satisfying V S (π(z)) lex V S (π(z)). The B-preferred solution for π can be coputed by solving a sequence of iniization probles: Let A 0 := and A i := A i 1 {z πi = } where = in zπi {v C A i 1 {z πi = v} has a solution} In figure 2 (right), S 1 and S 8 are B-preferred (for z 1 Z z 3 and z 2 Z z 3 ). Each B-preferred solution corresponds to an extree solution. If there are no preferences between criteria, each extree solution corresponds to soe B-preferred solution. If there are preferences between criteria certain extree solutions ay not be B-preferred. For exaple, S 15 is an extree solution, which is obtained if first the distance is iniized and then the price. However, this ranking of criteria does not respect the given preferences. In (Junker 1997), it has been shown that each B-preferred solution is a G-preferred one, but that the converse is not true in general. In figure 2 (right), S 2 to S 6 are G-preferred, but not B-preferred. These solutions assign a worse value to z 1 than the B-preferred solution S 1,but a better value than S 8. Siilarly, they assign a better value to z 2 than S 8,but aworse value than S 1.Itisevident that such a case cannot arise if each criteria has only two possible values. Hence, we get an equivalence in following case, where no coproises are possible: Proposition 2 If there is no z i such that v 1 zi v 2 zi v 3 and C {z = v i } has a solution for i =1, 2, 3 then each G-preferred solution of (C, X, Z, ) is also a B-preferred solution of (C, X, Z, ). So far, we siply adapted existing notions of preferred solutions to our preference structure and related the to well-known notions of optiality. We now introduce a new kind of preferred solutions that generalizes the balanced solutions. We want to be able to balance certain criteria, e.g. the price and the quality, but prefer these two criteria to other criteria such as the distance. Hence, we liit the balancing to certain groups of criteria instead of finding a coproise between all criteria. For this purpose, we partition Z into disjoint sets G 1,...,G k of criteria. Given a criterion z, we also denote its group by G(z). The criteria in a single group G i will be balanced. The groups theselves are handled by using a lexicographic approach. Thus, we can treat preferences between different groups, but not between different criteria of a single group. Given a strict partial order G between the G i s, wecan easily define an order Z between criteria: if G 1 G 2 and z i G 1, z j G 2 then z i Z z j. We now cobine definitions 5 and 3. As in definition 5, we first choose a global perutation π that respects the preferences between groups. We then locally sort the values of each balancing group in a decreasing order. We describe this local sorting by a perutation θ S that depends on a given solution S and that satisfies three conditions: 1. θ S can only exchange variables that belong to the sae balanced group: G(z i )=G(z θ S i ). AAAI-02 37
5 Algorith Extree-PBS1(C, Z, ) 1. A := ; U := Z; Q := ; 2. while Q U do 3. for all (z = q) Q do 4. let be iniize(c A, z, z) 5. if q z then Q := Q {z = q}; 6. if U = and Q then fail; 7. B := {y U y U : y Z y and 8. (y = q) Q}; 9. if B = then fail else 10. select z B; 11. let be iniize(c A, z, z); 12. choose A := A {z = }; U := U {z} 13. or Q := Q {z = }; 14. return A; Figure 3: Algorith Extree-PBS1 distance=4 quality=1 1st solution price=160 distance=4 quality=1 distance=2 price=250 2nd solution price=160 quality=4 distance=2 price=250 Figure 4: Finding extree solutions quality=4 2. θ S sorts the criteria of each group in a decreasing order: if v S (z i ) D v S (z j ) and G(z i )=G(z j ) then θi S <θj S. 3. θ S does not change the order if two criteria of the sae group have the sae value: if i<j, v S (z i )=v S (z j ), and G(z i )=G(z j ) then θi S <θj S. Definition 6 A solution S of (C, X ) is an E-preferred solution of (C, X, Z, ) if there exists a perutation π such that 1. π respects Z (i.e. z i Z z j iplies π i < π j ) and 2. there is no other solution S of (C, X ) s.t. V S (θ S (π(z))) lex V S (θ S (π(z))). In figure 2 (right), S 5 is E-preferred (z 1 Z z 3 and z 2 Z z 3 ). Each E-preferred solution corresponds to a balanced solution. If there are no preferences between criteria, each balanced solution corresponds to an E-preferred solution. Interestingly, we can ap E-preferred solutions to B- preferred solutions if we introduce suitable variables and preferences. For each group G of cardinality n G,weuse following in-ax-variables y G,nG,...,y G,1 : y G,i := in{ax(x) X G s.t. X = i} (1) where ax(x) := ax{z z X}. Let Ẑ be the set of all of these in-ax-variables. Following preferences ensure that in-ax-variables for larger subsets X are ore iportant: y G,i ˆ y G,i 1 for i = n G,...,2 (2) A preference between a group G and a group G can be translated into a preference between the last in-axvariable of G and the first one of G: y G,1 ˆ y G,nG (3) The E-preferred solutions then correspond to the B-preferred solutions of the translated criteria and preferences: Theore 1 S is an E-preferred solution of (C, X, Z, ) iff S is a B-preferred solution of (C, X, Ẑ, ˆ ). We have thus established variants of Pareto-optial, extree, and balanced solutions that take into account preferences between criteria. On the one hand, we gain a better understanding of the existing preferred solutions by this coparison with notions for ulti-criteria optiization. On the other hand, we obtain a balancing echanis that fits well into the qualitative preference fraework. Preference-based Search We now adapt the preference-based search algorith fro (Junker 2000) to treat preferences on criteria and to copute Pareto-optial solutions and balanced solutions as well. Extree Solutions The algorith in (Junker 2000) can easily be adapted to preferences on criteria. The resulting algorith is shown in figure 3. We explain its basic idea for the sall exaple shown in figure 4, where price and quality are preferred to distance. The algorith aintains a set U of unexplored criteria, which is initialized with the set of all criteria (i.e. price, quality, and distance). In each step, the algorith selects a best criterion z of U (e.g. the price). Instead of trying to assign different values to the total price, we deterine the cheapest price by solving a iniization subproble: iniize(a, z, z ):= (4) in z {v A {z = v} has a solution} In order to obtain a unique result, we assue that the orders zi are strict total orders throughout the entire section. In our exaple, the cheapest solution has a price of 160. We now add the assignent price = 160 to an initially epty set A of assignents. In figure 3, the eleents of A occur as labels of the left branches. We then deterine the best quality under this assignent. Once the price and quality have been deterined we can deterine a distance as well. In order to find further solutions, Extree-PBS1 does not add the negation of assignents, but introduces a refutation query for each assignent z = v. Wesay that z = v is d if it becoes inconsistent after assigning values to unexplored criteria that ay precede z. The refutation queries are added to a set Q. Wecan reove an eleent fro Q if it has been d by further assignents. The assignent to the distance cannot be d since there are no further unexplored criteria. The quality of 1 cannot be d since the single non-explored criterion distance cannot precede the 38 AAAI-02
6 quality. However, we can the price of 160 by first axiizing the quality. After this, we can again iniize the price and the distance, which leads to a new solution as shown in figure 3. Theore 2 Algorith Extree-PBS1(C, Z, ) always terinates. Each successful run returns a B-preferred solution of (C, X, Z, ) and each such B-preferred solution is returned by exactly one successful run. According to theore 1, we can use this algorith to also copute balanced solutions supposed we provide it with the adequately translated criteria and preferences. Pareto-optial Solutions The algorith for B-preferred solutions is thus relatively siple. Coputing G-preferred solutions turns out to be ore subtle. Interestingly, ost operations of algorith Extree-PBS1 are also valid for G-preferred solutions except for the rules in lines 6 and 8, where the algorith backtracks since no B-preferred solution exists that is copatible with the given assignents and refutation queries. An algorith for G-preferred solutions cannot backtrack in this case since there ay be G-preferred solutions, which are not B- preferred. In order to obtain an algorith for coputing G- preferred solutions, we have to avoid such a situation. The basic idea is to add additional constraints that produce the equivalence between G-preferred and B-preferred solutions that is stated in proposition 2. We need to reduce the doain of each criterion z such that all values are either a best or a worst eleent of the doain. If there are interediate values u between a best value q and a worst value v then we consider two possibilities: either we ipose u as upper bound on z by adding a constraint z z u or we require that z = u is d. In general, adding constraints can introduce new G-preferred solutions. Proposition 1 states that this is not the case if upper bounds are added. The resulting algorith is given in figure 5. It needs the set of values that have not yet been eliinated by soe upper bound: Pos(A, z) :={v (z u) A : u z v} (5) The algorith 5 deterines all G-preferred solutions: Theore 3 Algorith Pareto-PBS1(C, Z, ) always terinates. Each successful run returns a G-preferred solution of (C, X, Z, ) and each G-preferred solution is returned by exactly one successful run. Adding upper bounds thus helps to control the behaviour of PBS and to avoid that it jups fro one extree solution to the other. In figure 4, iniizing the quality s the cheapest price of 160, asitwas required. However, we now obtain a very high price of 250. Inorder to obtain coproises between price and quality, we constrain the price to be strictly saller than 250 before iniizing the quality. This discussion indicates that we need not consider all upper bounds. We first deterine an extree solution that leads to a high price and we use this value to ipose an upper bound on the price. Hence, we can extract the values of the upper bounds fro the previous solutions found so far. Algorith Pareto-PBS1(C, Z, ) 1. A := ; U := Z; Q := ; 2. while Q U do 3. for all (z = q) Q do 4. let be iniize(c A, z, z) 5. if q z then Q := Q {z = q}; 6. if U = and Q then fail; 7. B := {y U y U : y Z y and 8. (y = q) Q}; 9. if there is (z = q) Q and v, w Pos(A, z) 10. s.t. q z v z w then 11. select a z-inial eleent u 12. s.t. u Pos(A, z) and q z u z w; 13. choose A := A {z z u}; 14. or Q := Q {z = u}; 15. else if B = then fail else 16. select z B; 17. let be iniize(c A, z, z); 18. A := A {z z }; 19. choose A := A {z = }; U := U {z} 20. or Q := Q {z = }; 21. return A; Figure 5: Algorith Pareto-PBS1 Preference Projection A ulti-criteria optiization proble is often solved by a sequence of single-criterion optiization probles having different objectives. We can, for exaple, solve each of these subprobles by a constraint-based Branch-and-Bound which aintains the best objective value found so far. Now, when changing the objective, the search heuristics should be adapted as well. It is a natural idea to project the preference order of the objective to the decision variables that appear in its definition. We define preference projection as follows: Definition 7 xk is a projection of zj via f j (x 1,...,x ) to x k if and only if following condition holds for all u 1,...,u and v 1,...,v with u i = v i for i =1,...,k 1,k+1,...,: if u k xk v k then f j (u 1,...,u ) y f j (v 1,...,v ) Definition 8 x1,..., x is a projection of z1,..., zn via f 1,...,f n to x 1,...,x if xi is a projection of zj via f j (x 1,...,x ) to x i for all i, j. The projected preferences preserve Pareto-optiality: Theore 4 Let x1,..., x be a projection of z1,..., zn via f 1,...,f n to x 1,...,x. If S is a Paretooptial solution w.r.t. the criteria z 1,...,z n and the preferences z1,..., zn then there exists a solution S that 1. is apareto-optial solution w.r.t. the criteria x 1,...,x and the preferences x1,..., x and 2. v S (z i )=v S (z i ) for all criteria z i. Since extree and balanced solutions are Pareto-optial we can additionally use the projected preferences to reduce search effort when solving a sub-proble. For this purpose, we adapt the algorith Pareto-PBS1 to the decision (6) AAAI-02 39
7 variables x 1,...,x and do consistency checks instead of iniize-calls. We give soe exaples for preference projections: 1. The increasing order < is a projection of < via su, in, ax, and ultiplication with a positive coefficient. 2. The decreasing order > is a projection of < via a ultiplication with a negative coefficient. 3. Given an eleent constraint of the for y = f(x) that aps each possible value i of x to a value f(i), the following order x is a projection of < to x via f(x): u x v iff f(u) <f(v) (7) In our vacation exaple, the price, quality, and distance of a destination are all defined by eleent constraints. If we change the objective, we project preferences over a different eleent constraint. Since the projected preferences depend on the values f (e.g. price, quality), changing the objective will copletely change the order of the value assignents x i = u. Thus, the objective will have a strong ipact on the search heuristics. On the one hand, the first solution detected is influenced by the projected preferences and thus ay change when the objective is changed. On the other hand, search effort is reduced depending on the objective. Conclusion Although Preference-based Search (Junker 2000) provided an interesting technique for reducing search effort based on preferences, it could only take into account preferences between search decisions, was liited to cobinatorial probles of a special structure, and did not provide any ethod for finding coproises in absence of preferences. In this paper, we have lifted PBS fro preferences on decisions to preferences on criteria as they are coon in qualitative decision theory (Doyle & Thoason 1999; Bacchus & Grove 1995; Boutilier et al. 1997; Doshlak, Brafan, & Shiony 2001). We further generalized PBS such that not only extree solutions are coputed, but also balanced and Pareto-optial solutions. Surprisingly, balanced solutions can be coputed by a odified lexicographic approach (Ehrgott 1997) which fits well into a qualitative preference fraework as studied in nononotonic reasoning and qualitative decision theory. Our search procedure consists of two odules. A aster- PBS explores the criteria in different orders and assigns optial values to the. The optial value of a selected criterion is deterined by a sub-pbs, which perfors a constraintbased Branch-and-Bound search through the original proble space (i.e. the different value assignents to decision variables). We furtherore project the preferences on the selected criterion to preferences between the search decisions, which provides an adapted search heuristics for the optiization objective and which allows to reduce search effort further. Hence, different regions of the search space will be explored depending on the selected objective. Our approach has been ipleented in ILOG JCONFIGURATOR V2.0 and adds ulti-criteria optiization functionalities to this constraint-based configuration tool. Other CSP-based approaches to ulti-criteria optiization are doing a single Branch-and-Bound search for all criteria, which requires to aintain a set of non-doinated solutions (cf. (Boutilier et al. 1997), (Gavanelli 2002)) instead of a single bound. Doinance checking ensures that nonpreferred solutions are pruned. Interestingly, the Master- PBS does not need doinance checking, but uses refutation queries to avoid non-preferred solutions. Future work will be devoted to iprove the pruning behaviour of the new PBS procedures by incorporating the conflict checking ethods of (Junker 2000). We will also exaine whether PBS can be used to deterine preferred solutions as defined by soft constraints (Khatib et al. 2001). Acknowledgeents For helpful coents and discussions, I would like to thank Olivier Lhoe, Xavier Ceugniet, Daniel Mailharro, Mark Wallace, as well as the anonyous reviewers. References Bacchus, F., and Grove, A Graphical odels for preference and utility. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, Boutilier, C.; Brafan, R.; Geib, C.; and Poole, D A constraint-based approach to preference elicitation and decision aking. In Doyle, J., and Thoason, R. H., eds., Working Papers of the AAAI Spring Syposiu on Qualitative Preferences in Deliberation and Practical Reasoning. Brewka, G Preferred subtheories: An extended logical fraework for default reasoning. In IJCAI-89, Doshlak, C.; Brafan, R.; and Shiony, E Preference-based configuration of web-page content. In IJCAI Doyle, J., and Thoason, R. H Background to qualitative decision theory. AI Magazine 20(2): Ehrgott, M A characterization of lexicographic ax-ordering solutions. In Methods of Multicriteria Decision Theory: Proceedings of the 6th Workshop of the DGOR Working-Group Multicriteria Optiization and Decision Theory, Egelsbach: Häsel-Hohenhausen. Gavanelli, M An ipleentation of Pareto optiality in CLP(FD). In CP-AI-OR 02. Geffner, H., and Pearl, J Conditional entailent: Bridging two approaches to default reasoning. Artificial Intelligence 53: Grosof, B Generalizing prioritization. In KR 91, Cabridge, MA: Morgan Kaufann. Junker, U A cuulative-odel seantics for dynaic preferences on assuptions. In IJCAI-97, Junker, U Preference-based search for scheduling. In AAAI-2000, Khatib, L.; Morris, P.; Morris, R. A.; and Rossi, F Teporal constraint reasoning with preferences. In IJCAI, AAAI-02
RECURSIVE DYNAMIC PROGRAMMING: HEURISTIC RULES, BOUNDING AND STATE SPACE REDUCTION. Henrik Kure
RECURSIVE DYNAMIC PROGRAMMING: HEURISTIC RULES, BOUNDING AND STATE SPACE REDUCTION Henrik Kure Dina, Danish Inforatics Network In the Agricultural Sciences Royal Veterinary and Agricultural University
More informationMachine Learning Applications in Grid Computing
Machine Learning Applications in Grid Coputing George Cybenko, Guofei Jiang and Daniel Bilar Thayer School of Engineering Dartouth College Hanover, NH 03755, USA gvc@dartouth.edu, guofei.jiang@dartouth.edu
More informationResource Allocation in Wireless Networks with Multiple Relays
Resource Allocation in Wireless Networks with Multiple Relays Kağan Bakanoğlu, Stefano Toasin, Elza Erkip Departent of Electrical and Coputer Engineering, Polytechnic Institute of NYU, Brooklyn, NY, 0
More informationThis paper studies a rental firm that offers reusable products to price- and quality-of-service sensitive
MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol., No. 3, Suer 28, pp. 429 447 issn 523-464 eissn 526-5498 8 3 429 infors doi.287/so.7.8 28 INFORMS INFORMS holds copyright to this article and distributed
More informationData Set Generation for Rectangular Placement Problems
Data Set Generation for Rectangular Placeent Probles Christine L. Valenzuela (Muford) Pearl Y. Wang School of Coputer Science & Inforatics Departent of Coputer Science MS 4A5 Cardiff University George
More informationSearching strategy for multi-target discovery in wireless networks
Searching strategy for ulti-target discovery in wireless networks Zhao Cheng, Wendi B. Heinzelan Departent of Electrical and Coputer Engineering University of Rochester Rochester, NY 467 (585) 75-{878,
More informationON SELF-ROUTING IN CLOS CONNECTION NETWORKS. BARRY G. DOUGLASS Electrical Engineering Department Texas A&M University College Station, TX 77843-3128
ON SELF-ROUTING IN CLOS CONNECTION NETWORKS BARRY G. DOUGLASS Electrical Engineering Departent Texas A&M University College Station, TX 778-8 A. YAVUZ ORUÇ Electrical Engineering Departent and Institute
More informationReliability Constrained Packet-sizing for Linear Multi-hop Wireless Networks
Reliability Constrained acket-sizing for inear Multi-hop Wireless Networks Ning Wen, and Randall A. Berry Departent of Electrical Engineering and Coputer Science Northwestern University, Evanston, Illinois
More informationA Scalable Application Placement Controller for Enterprise Data Centers
W WWW 7 / Track: Perforance and Scalability A Scalable Application Placeent Controller for Enterprise Data Centers Chunqiang Tang, Malgorzata Steinder, Michael Spreitzer, and Giovanni Pacifici IBM T.J.
More informationCRM FACTORS ASSESSMENT USING ANALYTIC HIERARCHY PROCESS
641 CRM FACTORS ASSESSMENT USING ANALYTIC HIERARCHY PROCESS Marketa Zajarosova 1* *Ph.D. VSB - Technical University of Ostrava, THE CZECH REPUBLIC arketa.zajarosova@vsb.cz Abstract Custoer relationship
More informationOptimal Resource-Constraint Project Scheduling with Overlapping Modes
Optial Resource-Constraint Proect Scheduling with Overlapping Modes François Berthaut Lucas Grèze Robert Pellerin Nathalie Perrier Adnène Hai February 20 CIRRELT-20-09 Bureaux de Montréal : Bureaux de
More informationEnergy Efficient VM Scheduling for Cloud Data Centers: Exact allocation and migration algorithms
Energy Efficient VM Scheduling for Cloud Data Centers: Exact allocation and igration algoriths Chaia Ghribi, Makhlouf Hadji and Djaal Zeghlache Institut Mines-Téléco, Téléco SudParis UMR CNRS 5157 9, Rue
More informationDynamic Placement for Clustered Web Applications
Dynaic laceent for Clustered Web Applications A. Karve, T. Kibrel, G. acifici, M. Spreitzer, M. Steinder, M. Sviridenko, and A. Tantawi IBM T.J. Watson Research Center {karve,kibrel,giovanni,spreitz,steinder,sviri,tantawi}@us.ib.co
More informationAnalyzing Spatiotemporal Characteristics of Education Network Traffic with Flexible Multiscale Entropy
Vol. 9, No. 5 (2016), pp.303-312 http://dx.doi.org/10.14257/ijgdc.2016.9.5.26 Analyzing Spatioteporal Characteristics of Education Network Traffic with Flexible Multiscale Entropy Chen Yang, Renjie Zhou
More informationGenerating Certification Authority Authenticated Public Keys in Ad Hoc Networks
SECURITY AND COMMUNICATION NETWORKS Published online in Wiley InterScience (www.interscience.wiley.co). Generating Certification Authority Authenticated Public Keys in Ad Hoc Networks G. Kounga 1, C. J.
More informationAN ALGORITHM FOR REDUCING THE DIMENSION AND SIZE OF A SAMPLE FOR DATA EXPLORATION PROCEDURES
Int. J. Appl. Math. Coput. Sci., 2014, Vol. 24, No. 1, 133 149 DOI: 10.2478/acs-2014-0011 AN ALGORITHM FOR REDUCING THE DIMENSION AND SIZE OF A SAMPLE FOR DATA EXPLORATION PROCEDURES PIOTR KULCZYCKI,,
More informationEfficient Key Management for Secure Group Communications with Bursty Behavior
Efficient Key Manageent for Secure Group Counications with Bursty Behavior Xukai Zou, Byrav Raaurthy Departent of Coputer Science and Engineering University of Nebraska-Lincoln Lincoln, NE68588, USA Eail:
More informationFactored Models for Probabilistic Modal Logic
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008 Factored Models for Probabilistic Modal Logic Afsaneh Shirazi and Eyal Air Coputer Science Departent, University of Illinois
More informationLoad Control for Overloaded MPLS/DiffServ Networks during SLA Negotiation
Int J Counications, Network and Syste Sciences, 29, 5, 422-432 doi:14236/ijcns292547 Published Online August 29 (http://wwwscirporg/journal/ijcns/) Load Control for Overloaded MPLS/DiffServ Networks during
More informationAn Approach to Combating Free-riding in Peer-to-Peer Networks
An Approach to Cobating Free-riding in Peer-to-Peer Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 April 7, 2008
More informationSoftware Quality Characteristics Tested For Mobile Application Development
Thesis no: MGSE-2015-02 Software Quality Characteristics Tested For Mobile Application Developent Literature Review and Epirical Survey WALEED ANWAR Faculty of Coputing Blekinge Institute of Technology
More informationREQUIREMENTS FOR A COMPUTER SCIENCE CURRICULUM EMPHASIZING INFORMATION TECHNOLOGY SUBJECT AREA: CURRICULUM ISSUES
REQUIREMENTS FOR A COMPUTER SCIENCE CURRICULUM EMPHASIZING INFORMATION TECHNOLOGY SUBJECT AREA: CURRICULUM ISSUES Charles Reynolds Christopher Fox reynolds @cs.ju.edu fox@cs.ju.edu Departent of Coputer
More informationManaging Complex Network Operation with Predictive Analytics
Managing Coplex Network Operation with Predictive Analytics Zhenyu Huang, Pak Chung Wong, Patrick Mackey, Yousu Chen, Jian Ma, Kevin Schneider, and Frank L. Greitzer Pacific Northwest National Laboratory
More informationINTEGRATED ENVIRONMENT FOR STORING AND HANDLING INFORMATION IN TASKS OF INDUCTIVE MODELLING FOR BUSINESS INTELLIGENCE SYSTEMS
Artificial Intelligence Methods and Techniques for Business and Engineering Applications 210 INTEGRATED ENVIRONMENT FOR STORING AND HANDLING INFORMATION IN TASKS OF INDUCTIVE MODELLING FOR BUSINESS INTELLIGENCE
More informationMarkovian inventory policy with application to the paper industry
Coputers and Cheical Engineering 26 (2002) 1399 1413 www.elsevier.co/locate/copcheeng Markovian inventory policy with application to the paper industry K. Karen Yin a, *, Hu Liu a,1, Neil E. Johnson b,2
More informationarxiv:0805.1434v1 [math.pr] 9 May 2008
Degree-distribution stability of scale-free networs Zhenting Hou, Xiangxing Kong, Dinghua Shi,2, and Guanrong Chen 3 School of Matheatics, Central South University, Changsha 40083, China 2 Departent of
More informationMedia Adaptation Framework in Biofeedback System for Stroke Patient Rehabilitation
Media Adaptation Fraework in Biofeedback Syste for Stroke Patient Rehabilitation Yinpeng Chen, Weiwei Xu, Hari Sundara, Thanassis Rikakis, Sheng-Min Liu Arts, Media and Engineering Progra Arizona State
More informationAn Optimal Task Allocation Model for System Cost Analysis in Heterogeneous Distributed Computing Systems: A Heuristic Approach
An Optial Tas Allocation Model for Syste Cost Analysis in Heterogeneous Distributed Coputing Systes: A Heuristic Approach P. K. Yadav Central Building Research Institute, Rooree- 247667, Uttarahand (INDIA)
More informationApproximately-Perfect Hashing: Improving Network Throughput through Efficient Off-chip Routing Table Lookup
Approxiately-Perfect ing: Iproving Network Throughput through Efficient Off-chip Routing Table Lookup Zhuo Huang, Jih-Kwon Peir, Shigang Chen Departent of Coputer & Inforation Science & Engineering, University
More informationThe Application of Bandwidth Optimization Technique in SLA Negotiation Process
The Application of Bandwidth Optiization Technique in SLA egotiation Process Srecko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia
More informationPartitioned Elias-Fano Indexes
Partitioned Elias-ano Indexes Giuseppe Ottaviano ISTI-CNR, Pisa giuseppe.ottaviano@isti.cnr.it Rossano Venturini Dept. of Coputer Science, University of Pisa rossano@di.unipi.it ABSTRACT The Elias-ano
More informationA Fast Algorithm for Online Placement and Reorganization of Replicated Data
A Fast Algorith for Online Placeent and Reorganization of Replicated Data R. J. Honicky Storage Systes Research Center University of California, Santa Cruz Ethan L. Miller Storage Systes Research Center
More informationAUC Optimization vs. Error Rate Minimization
AUC Optiization vs. Error Rate Miniization Corinna Cortes and Mehryar Mohri AT&T Labs Research 180 Park Avenue, Florha Park, NJ 0793, USA {corinna, ohri}@research.att.co Abstract The area under an ROC
More informationASIC Design Project Management Supported by Multi Agent Simulation
ASIC Design Project Manageent Supported by Multi Agent Siulation Jana Blaschke, Christian Sebeke, Wolfgang Rosenstiel Abstract The coplexity of Application Specific Integrated Circuits (ASICs) is continuously
More informationAdaptive Modulation and Coding for Unmanned Aerial Vehicle (UAV) Radio Channel
Recent Advances in Counications Adaptive odulation and Coding for Unanned Aerial Vehicle (UAV) Radio Channel Airhossein Fereidountabar,Gian Carlo Cardarilli, Rocco Fazzolari,Luca Di Nunzio Abstract In
More informationFactor Model. Arbitrage Pricing Theory. Systematic Versus Non-Systematic Risk. Intuitive Argument
Ross [1],[]) presents the aritrage pricing theory. The idea is that the structure of asset returns leads naturally to a odel of risk preia, for otherwise there would exist an opportunity for aritrage profit.
More informationFuzzy Sets in HR Management
Acta Polytechnica Hungarica Vol. 8, No. 3, 2011 Fuzzy Sets in HR Manageent Blanka Zeková AXIOM SW, s.r.o., 760 01 Zlín, Czech Republic blanka.zekova@sezna.cz Jana Talašová Faculty of Science, Palacký Univerzity,
More informationMethod of supply chain optimization in E-commerce
MPRA Munich Personal RePEc Archive Method of supply chain optiization in E-coerce Petr Suchánek and Robert Bucki Silesian University - School of Business Adinistration, The College of Inforatics and Manageent
More informationPERFORMANCE METRICS FOR THE IT SERVICES PORTFOLIO
Bulletin of the Transilvania University of Braşov Series I: Engineering Sciences Vol. 4 (53) No. - 0 PERFORMANCE METRICS FOR THE IT SERVICES PORTFOLIO V. CAZACU I. SZÉKELY F. SANDU 3 T. BĂLAN Abstract:
More informationAn Innovate Dynamic Load Balancing Algorithm Based on Task
An Innovate Dynaic Load Balancing Algorith Based on Task Classification Hong-bin Wang,,a, Zhi-yi Fang, b, Guan-nan Qu,*,c, Xiao-dan Ren,d College of Coputer Science and Technology, Jilin University, Changchun
More informationInformation Processing Letters
Inforation Processing Letters 111 2011) 178 183 Contents lists available at ScienceDirect Inforation Processing Letters www.elsevier.co/locate/ipl Offline file assignents for online load balancing Paul
More informationInternational Journal of Management & Information Systems First Quarter 2012 Volume 16, Number 1
International Journal of Manageent & Inforation Systes First Quarter 2012 Volue 16, Nuber 1 Proposal And Effectiveness Of A Highly Copelling Direct Mail Method - Establishent And Deployent Of PMOS-DM Hisatoshi
More informationReal Time Target Tracking with Binary Sensor Networks and Parallel Computing
Real Tie Target Tracking with Binary Sensor Networks and Parallel Coputing Hong Lin, John Rushing, Sara J. Graves, Steve Tanner, and Evans Criswell Abstract A parallel real tie data fusion and target tracking
More informationResearch Article Performance Evaluation of Human Resource Outsourcing in Food Processing Enterprises
Advance Journal of Food Science and Technology 9(2): 964-969, 205 ISSN: 2042-4868; e-issn: 2042-4876 205 Maxwell Scientific Publication Corp. Subitted: August 0, 205 Accepted: Septeber 3, 205 Published:
More informationAirline Yield Management with Overbooking, Cancellations, and No-Shows JANAKIRAM SUBRAMANIAN
Airline Yield Manageent with Overbooking, Cancellations, and No-Shows JANAKIRAM SUBRAMANIAN Integral Developent Corporation, 301 University Avenue, Suite 200, Palo Alto, California 94301 SHALER STIDHAM
More informationEnergy Proportionality for Disk Storage Using Replication
Energy Proportionality for Disk Storage Using Replication Jinoh Ki and Doron Rote Lawrence Berkeley National Laboratory University of California, Berkeley, CA 94720 {jinohki,d rote}@lbl.gov Abstract Energy
More informationUsing Bloom Filters to Refine Web Search Results
Using Bloo Filters to Refine Web Search Results Navendu Jain Departent of Coputer Sciences University of Texas at Austin Austin, TX, 78712 nav@cs.utexas.edu Mike Dahlin Departent of Coputer Sciences University
More informationOnline Community Detection for Large Complex Networks
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Online Counity Detection for Large Coplex Networks Wangsheng Zhang, Gang Pan, Zhaohui Wu, Shijian Li Departent
More informationExtended-Horizon Analysis of Pressure Sensitivities for Leak Detection in Water Distribution Networks: Application to the Barcelona Network
2013 European Control Conference (ECC) July 17-19, 2013, Zürich, Switzerland. Extended-Horizon Analysis of Pressure Sensitivities for Leak Detection in Water Distribution Networks: Application to the Barcelona
More informationA framework for performance monitoring, load balancing, adaptive timeouts and quality of service in digital libraries
Int J Digit Libr (2000) 3: 9 35 INTERNATIONAL JOURNAL ON Digital Libraries Springer-Verlag 2000 A fraework for perforance onitoring, load balancing, adaptive tieouts and quality of service in digital libraries
More informationA Study on the Chain Restaurants Dynamic Negotiation Games of the Optimization of Joint Procurement of Food Materials
International Journal of Coputer Science & Inforation Technology (IJCSIT) Vol 6, No 1, February 2014 A Study on the Chain estaurants Dynaic Negotiation aes of the Optiization of Joint Procureent of Food
More informationHalloween Costume Ideas for the Wii Game
Algorithica 2001) 30: 101 139 DOI: 101007/s00453-001-0003-0 Algorithica 2001 Springer-Verlag New York Inc Optial Search and One-Way Trading Online Algoriths R El-Yaniv, 1 A Fiat, 2 R M Karp, 3 and G Turpin
More informationThe AGA Evaluating Model of Customer Loyalty Based on E-commerce Environment
6 JOURNAL OF SOFTWARE, VOL. 4, NO. 3, MAY 009 The AGA Evaluating Model of Custoer Loyalty Based on E-coerce Environent Shaoei Yang Econoics and Manageent Departent, North China Electric Power University,
More informationEvaluating Inventory Management Performance: a Preliminary Desk-Simulation Study Based on IOC Model
Evaluating Inventory Manageent Perforance: a Preliinary Desk-Siulation Study Based on IOC Model Flora Bernardel, Roberto Panizzolo, and Davide Martinazzo Abstract The focus of this study is on preliinary
More informationQuality evaluation of the model-based forecasts of implied volatility index
Quality evaluation of the odel-based forecasts of iplied volatility index Katarzyna Łęczycka 1 Abstract Influence of volatility on financial arket forecasts is very high. It appears as a specific factor
More informationUse of extrapolation to forecast the working capital in the mechanical engineering companies
ECONTECHMOD. AN INTERNATIONAL QUARTERLY JOURNAL 2014. Vol. 1. No. 1. 23 28 Use of extrapolation to forecast the working capital in the echanical engineering copanies A. Cherep, Y. Shvets Departent of finance
More informationConsiderations on Distributed Load Balancing for Fully Heterogeneous Machines: Two Particular Cases
Considerations on Distributed Load Balancing for Fully Heterogeneous Machines: Two Particular Cases Nathanaël Cheriere Departent of Coputer Science ENS Rennes Rennes, France nathanael.cheriere@ens-rennes.fr
More informationThe individual neurons are complicated. They have a myriad of parts, subsystems and control mechanisms. They convey information via a host of
CHAPTER 4 ARTIFICIAL NEURAL NETWORKS 4. INTRODUCTION Artificial Neural Networks (ANNs) are relatively crude electronic odels based on the neural structure of the brain. The brain learns fro experience.
More informationAn Improved Decision-making Model of Human Resource Outsourcing Based on Internet Collaboration
International Journal of Hybrid Inforation Technology, pp. 339-350 http://dx.doi.org/10.14257/hit.2016.9.4.28 An Iproved Decision-aking Model of Huan Resource Outsourcing Based on Internet Collaboration
More informationOn Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
On Coputing Nearest Neighbors with Applications to Decoding of Binary Linear Codes Alexander May and Ilya Ozerov Horst Görtz Institute for IT-Security Ruhr-University Bochu, Gerany Faculty of Matheatics
More informationPREDICTION OF POSSIBLE CONGESTIONS IN SLA CREATION PROCESS
PREDICTIO OF POSSIBLE COGESTIOS I SLA CREATIO PROCESS Srećko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia Tel +385 20 445-739,
More informationPosition Auctions and Non-uniform Conversion Rates
Position Auctions and Non-unifor Conversion Rates Liad Blurosen Microsoft Research Mountain View, CA 944 liadbl@icrosoft.co Jason D. Hartline Shuzhen Nong Electrical Engineering and Microsoft AdCenter
More informationStandards and Protocols for the Collection and Dissemination of Graduating Student Initial Career Outcomes Information For Undergraduates
National Association of Colleges and Eployers Standards and Protocols for the Collection and Disseination of Graduating Student Initial Career Outcoes Inforation For Undergraduates Developed by the NACE
More informationOnline Bagging and Boosting
Abstract Bagging and boosting are two of the ost well-known enseble learning ethods due to their theoretical perforance guarantees and strong experiental results. However, these algoriths have been used
More informationCLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR HONG KONG CARTRIDGE RECYCLING INDUSTRY
CLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR HONG KONG CARTRIDGE RECYCLING INDUSTRY Y. T. Chen Departent of Industrial and Systes Engineering Hong Kong Polytechnic University, Hong Kong yongtong.chen@connect.polyu.hk
More informationModels and Algorithms for Stochastic Online Scheduling 1
Models and Algoriths for Stochastic Online Scheduling 1 Nicole Megow Technische Universität Berlin, Institut für Matheatik, Strasse des 17. Juni 136, 10623 Berlin, Gerany. eail: negow@ath.tu-berlin.de
More informationEvaluating the Effectiveness of Task Overlapping as a Risk Response Strategy in Engineering Projects
Evaluating the Effectiveness of Task Overlapping as a Risk Response Strategy in Engineering Projects Lucas Grèze Robert Pellerin Nathalie Perrier Patrice Leclaire February 2011 CIRRELT-2011-11 Bureaux
More informationEquivalent Tapped Delay Line Channel Responses with Reduced Taps
Equivalent Tapped Delay Line Channel Responses with Reduced Taps Shweta Sagari, Wade Trappe, Larry Greenstein {shsagari, trappe, ljg}@winlab.rutgers.edu WINLAB, Rutgers University, North Brunswick, NJ
More informationModeling Nurse Scheduling Problem Using 0-1 Goal Programming: A Case Study Of Tafo Government Hospital, Kumasi-Ghana
Modeling Nurse Scheduling Proble Using 0-1 Goal Prograing: A Case Study Of Tafo Governent Hospital, Kuasi-Ghana Wallace Agyei, Willia Obeng-Denteh, Eanuel A. Andaa Abstract: The proble of scheduling nurses
More informationTrading Regret for Efficiency: Online Convex Optimization with Long Term Constraints
Journal of Machine Learning Research 13 2012) 2503-2528 Subitted 8/11; Revised 3/12; Published 9/12 rading Regret for Efficiency: Online Convex Optiization with Long er Constraints Mehrdad Mahdavi Rong
More informationApplying Multiple Neural Networks on Large Scale Data
0 International Conference on Inforation and Electronics Engineering IPCSIT vol6 (0) (0) IACSIT Press, Singapore Applying Multiple Neural Networks on Large Scale Data Kritsanatt Boonkiatpong and Sukree
More informationADJUSTING FOR QUALITY CHANGE
ADJUSTING FOR QUALITY CHANGE 7 Introduction 7.1 The easureent of changes in the level of consuer prices is coplicated by the appearance and disappearance of new and old goods and services, as well as changes
More informationHow To Get A Loan From A Bank For Free
Finance 111 Finance We have to work with oney every day. While balancing your checkbook or calculating your onthly expenditures on espresso requires only arithetic, when we start saving, planning for retireent,
More informationThe Research of Measuring Approach and Energy Efficiency for Hadoop Periodic Jobs
Send Orders for Reprints to reprints@benthascience.ae 206 The Open Fuels & Energy Science Journal, 2015, 8, 206-210 Open Access The Research of Measuring Approach and Energy Efficiency for Hadoop Periodic
More informationImage restoration for a rectangular poor-pixels detector
Iage restoration for a rectangular poor-pixels detector Pengcheng Wen 1, Xiangjun Wang 1, Hong Wei 2 1 State Key Laboratory of Precision Measuring Technology and Instruents, Tianjin University, China 2
More informationA Multi-Core Pipelined Architecture for Parallel Computing
Parallel & Cloud Coputing PCC Vol, Iss A Multi-Core Pipelined Architecture for Parallel Coputing Duoduo Liao *1, Sion Y Berkovich Coputing for Geospatial Research Institute Departent of Coputer Science,
More informationReconnect 04 Solving Integer Programs with Branch and Bound (and Branch and Cut)
Sandia is a ultiprogra laboratory operated by Sandia Corporation, a Lockheed Martin Copany, Reconnect 04 Solving Integer Progras with Branch and Bound (and Branch and Cut) Cynthia Phillips (Sandia National
More informationCooperative Caching for Adaptive Bit Rate Streaming in Content Delivery Networks
Cooperative Caching for Adaptive Bit Rate Streaing in Content Delivery Networs Phuong Luu Vo Departent of Coputer Science and Engineering, International University - VNUHCM, Vietna vtlphuong@hciu.edu.vn
More informationPerformance Evaluation of Machine Learning Techniques using Software Cost Drivers
Perforance Evaluation of Machine Learning Techniques using Software Cost Drivers Manas Gaur Departent of Coputer Engineering, Delhi Technological University Delhi, India ABSTRACT There is a treendous rise
More informationThe Design and Implementation of an Enculturated Web-Based Intelligent Tutoring System
The Design and Ipleentation of an Enculturated Web-Based Intelligent Tutoring Syste Phaedra Mohaed Departent of Coputing and Inforation Technology The University of the West Indies phaedra.ohaed@gail.co
More informationLEAN FOR FRONTLINE MANAGERS IN HEALTHCARE An action learning programme for frontline healthcare managers
Course Code: L024 LEAN FOR FRONTLINE MANAGERS IN HEALTHCARE An action learning prograe for frontline healthcare anagers 6 days Green Belt equivalent Are you ready to challenge the status quo and transfor
More informationThe Velocities of Gas Molecules
he Velocities of Gas Molecules by Flick Colean Departent of Cheistry Wellesley College Wellesley MA 8 Copyright Flick Colean 996 All rights reserved You are welcoe to use this docuent in your own classes
More informationEntity Search Engine: Towards Agile Best-Effort Information Integration over the Web
Entity Search Engine: Towards Agile Best-Effort Inforation Integration over the Web Tao Cheng, Kevin Chen-Chuan Chang University of Illinois at Urbana-Chapaign {tcheng3, kcchang}@cs.uiuc.edu. INTRODUCTION
More informationModeling operational risk data reported above a time-varying threshold
Modeling operational risk data reported above a tie-varying threshold Pavel V. Shevchenko CSIRO Matheatical and Inforation Sciences, Sydney, Locked bag 7, North Ryde, NSW, 670, Australia. e-ail: Pavel.Shevchenko@csiro.au
More informationAudio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA
Audio Engineering Society Convention Paper Presented at the 119th Convention 2005 October 7 10 New York, New York USA This convention paper has been reproduced fro the authors advance anuscript, without
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, ACCEPTED FOR PUBLICATION 1. Secure Wireless Multicast for Delay-Sensitive Data via Network Coding
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, ACCEPTED FOR PUBLICATION 1 Secure Wireless Multicast for Delay-Sensitive Data via Network Coding Tuan T. Tran, Meber, IEEE, Hongxiang Li, Senior Meber, IEEE,
More informationExploiting Hardware Heterogeneity within the Same Instance Type of Amazon EC2
Exploiting Hardware Heterogeneity within the Sae Instance Type of Aazon EC2 Zhonghong Ou, Hao Zhuang, Jukka K. Nurinen, Antti Ylä-Jääski, Pan Hui Aalto University, Finland; Deutsch Teleko Laboratories,
More information6. Time (or Space) Series Analysis
ATM 55 otes: Tie Series Analysis - Section 6a Page 8 6. Tie (or Space) Series Analysis In this chapter we will consider soe coon aspects of tie series analysis including autocorrelation, statistical prediction,
More informationHow To Balance Over Redundant Wireless Sensor Networks Based On Diffluent
Load balancing over redundant wireless sensor networks based on diffluent Abstract Xikui Gao Yan ai Yun Ju School of Control and Coputer Engineering North China Electric ower University 02206 China Received
More informationImplementation of Active Queue Management in a Combined Input and Output Queued Switch
pleentation of Active Queue Manageent in a obined nput and Output Queued Switch Bartek Wydrowski and Moshe Zukeran AR Special Research entre for Ultra-Broadband nforation Networks, EEE Departent, The University
More informationMulti-Class Deep Boosting
Multi-Class Deep Boosting Vitaly Kuznetsov Courant Institute 25 Mercer Street New York, NY 002 vitaly@cis.nyu.edu Mehryar Mohri Courant Institute & Google Research 25 Mercer Street New York, NY 002 ohri@cis.nyu.edu
More information- 265 - Part C. Property and Casualty Insurance Companies
Part C. Property and Casualty Insurance Copanies This Part discusses proposals to curtail favorable tax rules for property and casualty ("P&C") insurance copanies. The syste of reserves for unpaid losses
More informationOptimal Times to Decrease Extraction Rates During Two-Stage Remediation Affected by Rate-Limited Transport Jose A. Saez, Loyola Marymount University
Optial Ties to Decrease Extraction ates During Two-Stage eediation Affected by ate-liited Transport Jose A. Saez, Loyola Maryount University Abstract Saez and Haron presented a two-stage pup and treat
More informationDesign of Model Reference Self Tuning Mechanism for PID like Fuzzy Controller
Research Article International Journal of Current Engineering and Technology EISSN 77 46, PISSN 347 56 4 INPRESSCO, All Rights Reserved Available at http://inpressco.co/category/ijcet Design of Model Reference
More informationPricing Asian Options using Monte Carlo Methods
U.U.D.M. Project Report 9:7 Pricing Asian Options using Monte Carlo Methods Hongbin Zhang Exaensarbete i ateatik, 3 hp Handledare och exainator: Johan Tysk Juni 9 Departent of Matheatics Uppsala University
More informationSUPPORTING YOUR HIPAA COMPLIANCE EFFORTS
WHITE PAPER SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS Quanti Solutions. Advancing HIM through Innovation HEALTHCARE SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS Quanti Solutions. Advancing HIM through Innovation
More informationModeling Parallel Applications Performance on Heterogeneous Systems
Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln
More informationImpact of Processing Costs on Service Chain Placement in Network Functions Virtualization
Ipact of Processing Costs on Service Chain Placeent in Network Functions Virtualization Marco Savi, Massio Tornatore, Giacoo Verticale Dipartiento di Elettronica, Inforazione e Bioingegneria, Politecnico
More informationThe Fundamentals of Modal Testing
The Fundaentals of Modal Testing Application Note 243-3 Η(ω) = Σ n r=1 φ φ i j / 2 2 2 2 ( ω n - ω ) + (2ξωωn) Preface Modal analysis is defined as the study of the dynaic characteristics of a echanical
More informationWork Travel and Decision Probling in the Network Marketing World
TRB Paper No. 03-4348 WORK TRAVEL MODE CHOICE MODELING USING DATA MINING: DECISION TREES AND NEURAL NETWORKS Chi Xie Research Assistant Departent of Civil and Environental Engineering University of Massachusetts,
More information