Ralph Otten and Lukas van Ginneken, The annealing algorithm, Kluwer academic publishers, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....whole process can be repeated from different starting points. One of the main problems with hill climbing is that it may settle in local optima states which are better than all the neighbours but not necessarily the best possible solution. To overcome that, methods such as simulated annealing [1, 7, 20] and tabu search [10, 11, 12] have been proposed. In this paper, we present a method, called Guided Local Search (GLS) to guide local search to escape local optima. Like tabu search, this method also allows the software engineer to build knowledge into the algorithm to guide the search towards ....

R.H.J.M. Otten and L.P.P.P. van Ginneken, The annealing algorithm, Kluwer Academic Publishers, 1989.

....cost associated with not finding the global minimumwould usually be acceptable. For a quantitative description of the term hard , see for example, 1] There exist several popular methods for solving global optimization problems (P1) or (P2) see [3] for example) Simulated Annealing (see [4] and the references therein) describes a family of iterative methods where every iteration consists of taking a step in parameter space with a probability that decays exponentially with an energy function associated with the new parameter value. This technique reportedly performs well and has ....

R. H. J. M. Otten and L. P. P. P. van Ginneken, The Annealing Algorithm, Kluwer Academic Publishers, (1989).

....string until a local maximum is reached; the initial string was generated randomly. Simulated annealing: powerful, often used probabilistic method which is based on the imitation of the solidification of a crystal under slowly decreasing temperature (see [ van Laarhoven and Aarts, 1987 ] or [ Otten and van Ginneken, 1989 ] for a detailed description) Raw genetic algorithm with proportional selection, one point crossing over, and bitwise mutation (see [ Goldberg, 1989 ] Geyer Schulz, 1994 ] or [ Holland, 1975 ] the size of the population was 20. Hybrid GA: combination of a genetic algorithm with the hill ....

R. H. J. M. Otten and L. P. P. P. van Ginneken. The Annealing Algorithm. Kluwer Academic Publishers, Boston /Dordrecht/London, 1989.

....method in widespread use is simulated annealing. It was introduced independently by Cerny in [12] and Kirkpatrick et al. in [28] and popularized for vision by Geman and Geman in [20] There are several variants of this method, we will describe the version in [20] For a comprehensive review, see [32]. 13 The algorithm simulates the physical annealing of a material. Physical annealing is a process which determines the low energy states of a material by gradually lowering the energy. Simulated annealing is controlled by a parameter called temperature. In the beginning the temperature is set ....

....spaces Most of the minimization problems we consider in this work are NP hard. We approach these problems by nding a local minimum. However in discrete setting, there are many ways to de ne a local minimum. A natural way to categorize these local minima is through the concept of move spaces, see [32]. We de ne a local minimum is de ned with respect to allowed moves. A move is a pair of labelings (f; f 0 ) 2 F F , where F is the set of all labelings. Let M F F be a set of moves, which we also call a move space. If (f; f 0 ) 2 M, then we will say that f is within one move from f 0 ....

R.H.J.M. Otten and L.P.P.P van Ginneken. The Annealing Algorithm. Kluwer Academic Publishers, 1989.

....different initial solutions increases. Another way to increase the expected probability of finding a global minimum with a heuristic algorithm is to allow the acceptance of solutions with cost greater than that of the current solution. This allows the algorithm to hill climb out of local minima [61, 77, 83]. Randomizing algorithms have this property. A randomizing algorithm will always accept a randomly generated neighbor of the current solution as the next solution, regardless of relative cost. Since randomizing j R i lm : c i lm ( c j ( 4 algorithms allow the acceptance of solutions ....

....extreme computational requirements needed by SA to generate these types of solutions. Because of this, there has been considerable effort aimed at accelerating the SA paradigm since its introduction. The majority of the early work in this area focused on the development of faster cooling schedules [1, 46, 48, 61, 62, 75, 77]. The cooling schedule defines the exact manner in which the algorithm proceeds towards 6 a final solution. The cooling schedule is divided into a number of time periods, each corresponding to a different temperature value. As each period completes, the temperature is lowered until the algorithm ....

[Article contains additional citation context not shown here]

R.H.J.M. Otten and L.P.P.P. Ginneken, The Annealing Algorithm, Kluwer Academic Publishers, Boston, MA, 1989.

....to the best fitted neighbor of the current string until a local maximum is reached; the initial string is generated randomly. Simulated annealing: powerful, often used probabilistic method which is based on the imitation of the solidification of a crystal under slowly decreasing temperature (see [7, 9] for a detailed description) Each one of these methods requires only a few binary operations in each step. Most of the time is consumed by the evaluation of the fitness function. So, it is near at hand to take the number of evaluations as a measure for the speed of the algorithms. Results All ....

R. H. J. M. Otten and L. P. P. P. van Ginneken. The Annealing Algorithm. Kluwer Academic Publishers, Boston, 1989.

....reorganization of the graph is also left open. The technique described in [12] seems to be a good candidate and we would like to merge that into CGM. We have also learned that simulated annealing is successfully used to perform similar tasks in graph display layout and VLSI component layout [21, 22]. It would be interesting to examine the applicability of this approach to graph clustering, and conversely, to see whether our techniques can be applied to the problem of laying out a graph on a two dimensional screen. ....

R. Otten and L. van Ginneken. The Annealing Algorithm. Kluwer Academic Publishers, Boston, 1989. 10

.... always seeks for a low energy drawing (i.e. minimum overall force magnitudes on vertices) However, in many cases, it is required to move through a worse drawing (i.e. with larger forces on vertices) before finding a better drawing [16] This process is called hill climbing in simulated annealing[22, 28]. When a Spring algorithm finds an undesirable local minimum in which the forces are small, such a drawing still needs to go through a hill climbing process. However, if the forces on vertices are small then the vertices won t have the ability to make the large enough movements to come out of the ....

R. Otten and L. Van Ginneken. The Annealing Algorithm. Kluwer Academic Publishers, Boston, 1989.

....w = w 0 and cost U = U(w 0 ) B. generate new candidate and the corresponding U C. if exp( Gamma U GammaU T ) 2 (0; 1) with p( 1 (i.e. uniform) then w = and w = f D. decrease T E. if T T end then go to B Examples of stochastic optimisation methods are simulated annealing [12, 18], where steps in search space are defined by a random walk Markov Process. This is mostly implemented as the Metropolis Hastings algorithm, where the probability of accepting the candidate steps is dictated by the difference in cost function and a time varying temperature T , see also Scheme 1. In ....

Otten R.H.J.M., van Ginneken L.P.P.P., The Annealing Algorithm, Kluwer Academic Publishers, 1989.

....exist based on the temperature schedule, the cost function, the generation of the moves or the acceptance probability law. It is possible to found the choice and the adaptation of the temperature schedule by using an analysis of the distribution of energy like White [33] Otten and van Ginneken [28]. A second possibility of research lies in the adaptation of the generation of the moves. White [33] defines the concept of scale of moves. He proposes to favor the generation of large scale moves at high temperature and smaller ones at low temperature. Ingber ( 24] 25] proposes a choice of ....

R.H.J.M. Otten and L.P.P.P. van Ginneken. The Annealing Algorithm. Kluwer Academic Publisher, 1989.

....a transition results and x new replaces x current . Unlike local optimization methods, which accept only lower cost transitions terminating at the local minimum, the simulated annealing method uses the Metropolis algorithm where the probability of accepting a higher cost configuration is non zero [1, 41]. This feature allows the search to proceed uphill, away from a local minimum, in search of a more global minimum. A transition from x current to x new is made with probability M , where: M(x new ; x current ; 8 : exp i f(xcurrent ) Gammaf (xnew ) j if f(x new ) f(x current ....

R. H. J. M. Otten and L.P.P.P. van Ginneken. The Anealing Algorithms. Kluwer Academic Publishers, Boston, 1989. 117

....merged with its 3 neighbours if its parent produces a stronger measure than its own and its 3 neighbours. The best texture feature to be used at a given resolution is stored in a feature table, the design and construction of which is described in [77] The MTS algorithm uses simulated annealing [131, 96, 1, 31] to control splitting and merging of blocks. Simulated annealing is a technique used for large scale optimisation problems. Typically, these problems involve combinatorial minimisation. There is an objective function (energy configuration) to minimise and the space in which the solution is ....

P.J.M. van Laarhoven and E.H.L. Aarts. Simulated annealing: theory and applications. Kluwer Academic Publishers, 1988.

....4.1 the simulated annealing approach is described. In Section 4.2 the constrained optimization approach, used by the CO algorithm, is described. The CO algorithm is presented in Section 4.3 and the proposed MTS algorithm is presented in Section 4.4. 4. 1 Simulated Annealing Simulated Annealing [35, 52] is a technique used for optimization problems of a large scale. Typically, these problems involve combinatorial minimization. There is an objective function to minimize and the space in which the solution is obtained is a large, discrete configuration space such as all the possible allocations of ....

P.J.M. van Laarhoven and E.H.L. Aarts. Simulated Annealing: Theory and Applications. Kluwer Academic Publishers, 1988.

....] 7) 3) simply states that G s is a probability vector. 4) guarantees that the annealing chain is irreducible. 5) and (6) ensure that the chain is aperiodic and finite. Irreducible, aperiodic, finite Markov chains are ergodic. 5 The symmetry property of G (7) produces three useful results [15]: first, the equilibrium probability is otherwise independent of G; second, the annealing chain is reversible, namely, 8i; j 2 S; ae(i)P ij = ae(j)P ji (8) third, the equilibrium probabilities are given by the Boltzmann distribution, namely, ae(s; T ) e GammaC(s) T P s 0 2S e GammaC(s ....

.... is reversible, namely, 8i; j 2 S; ae(i)P ij = ae(j)P ji (8) third, the equilibrium probabilities are given by the Boltzmann distribution, namely, ae(s; T ) e GammaC(s) T P s 0 2S e GammaC(s 0 ) T : 9) Properties (3) 7) are slightly different from those of Otten and van Ginneken [15]: instead of (5) they ensure aperiodicity by 8s 2 S; G s;s 6= 0, a requirement not typically satisfied by annealing programs. In contrast, 5) is trivially satisfied if 9s; s 0 2 S; C(s) 6= C(s 0 ) 3. Equilibrium Properties In this section, we establish a relationship between the ....

[Article contains additional citation context not shown here]

Otten, R., and van Ginneken, L. The Annealing Algorithm. Kluwer Academic Publishers, Boston, 1989.

....modal and modal like logics such as description logic, hybrid logic, temporal logic, etc. The connections between logic and computing are wide spread and varied. Wellknown examples of uses of logic in computer science include automated verification [25] databases [2] knowledge representation [8], artificial intelligence [20] formal languages [28] etc. Going in the opposite direction, from computer science to logic, we find extremely fast implementations of model checkers and tableaux based and resolution based theorem provers [9] automata theoretic methods for deciding powerful ....

....Buning and T. Lettman. Propositional Logic: Deduction and Algorithms.Cam bridge University Press, 1999. Originally published in German by B. G. Teubner, 1994. 7] A. Bleeker and L. Meertens. Knowledge in security protocols: an operational semantics for BAN logic. In Areces and de Rijke [1] [8] G. Brewka, editor. Principles of Knowledge Representation. CSLI Publications, 1996. 9] W. Bibel and P. Schmitt, editors. Automated Deduction A Basis for Applications.Kluwer Academic Publishers, 1998. 10] G. Bonanno and W. van der Hoek. LOFT 3. Special issue of Games and Economic Theory, ....

[Article contains additional citation context not shown here]

J. van Benthem. The Logic of Time. Kluwer Academic Publishers, Dordrecht, second edition, 1991.

....etc. Apart from what is defined at this level, no character in an encoded text has any semantics other than its identity as a graphic character. The Standard Generalized Markup Language (SGML) with the reference concrete syntax formally defined in ISO 8879 (see [Pric94] Gold90] Brya88] and [Herw91]) is unique in that it is a standard at the metalanguage level only. That is, the SGML reference concrete syntax defines tag form (any sequence of characters surrounded by and ) the base character set, naming rules, reserved words, allowable features (e.g. omission of end tags) etc. ....

van Herwijnen, E. Practical SGML, Kluwer Academic Publishers, Boston (1991).

....(Second order frame classes) By making use of mixed formulas (that is, formulas containing both nominals and ordinary propositional variables) we can de ne Z, the integers in their usual order, up to isomorphism; this cannot be done in rst order logic. The key observation is due to van Benthem [8], who points out that the simple hFi and hPi language can almost de ne Z. As he notes, the formula ( P] P]p p) hPi[P]p [P]p) F] F]p p) hFi[F]p [F]p) a bidirectional variant of the L ob formula used in modal provability logic) de nes Z up to isomorphism on the class of ....

J. van Benthem. The Logic of Time. Kluwer Academic Publishers, Dordrecht, second edition, 1991.

....discrete temporal logic [17] 5 and contains, in addition, an indexed set of unary modal connectives for knowledge. These connectives satisfy analogues of the modal system S5, which is widely recognized as a logic of idealized knowledge. We 5 Surveys of research on temporal reasoning include [5, 6, 3, 36, 56, 2, 9]. study the behaviour of bounded agents and therefore do not apply modal logic, but rather choose a syntactic approach for the modalities. Georgeff and Rao [48, 47] consider complex possible worlds semantics (and thus also suffer from the omniscience problem) In their formalism, the ....

J. van Benthem. The logic of time. Kluwer Academic Publishers, 1991.

.... soif1 and soif2 . It is possible to select different SOIF attributes based on SGML attribute values. For example, if ATT is an attribute of TAG , then it would be written like this: TAG,ATT=x x stuff TAG,ATT=y y stuff TAG stuff 24 A good reference for learning how to write DTDs is [18]. 17 The second two mappings place values of SGML attributes into SOIF attributes. To place the value of the ATT attribute of the TAG tag into the att stuff SOIF attribute you would write: TAG:ATT att stuff It is also possible to place the value of an SGML attribute into a SOIF ....

E. van Herwijnen. Practical SGML. Kluwer Academic Publishers, 1994. Second Edition.

....for the patient information contains the name of the patient and a sequence of visit data. Each visit information consists of the day, the names of the clinic and the doctor, and the problem of the patient. SGML (Standard Generalized Markup Language) is an international standard [ISO86, Gol90, vH94] to define the notation which is used to represent hierarchically structured documents. The structure is defined using the DTD (Document Type Definition) The DTD is common for a set of documents (for example, a set of books, articles, patient records) and all the documents of the same type have ....

E. van Herwijnen. Practical SGML. Kluwer Academic Publisher, Dordrecht, 1994.

.... Logical Structures of Documents into SGML Markups Rolf Brugger October 1994 1 Introduction In this article a generator for SGML marked up ASCII text is presented. It has been integrated into the OSCAR II prototype (further referred to as document recognition module) which is part of a project for structural optical recognition of printed documents. This has been used ....

....the specific structure to SGML translator. The translation table has to be created by hand. The relations between DTD, document description and translation table, and the SGML generator algorithm will be documented in detail in Section 3 and the edition of a translation table in Section 4. 2 2.1.2 The generic structure used by the document recognition module As explained in the previous section the document recognition module (the analyzer respectively) is parameterized by a generic description of the document class to be recognized. It defines on the one hand the entities that ....

[Article contains additional citation context not shown here]

E. Van Herwijnen. Practical SGML. Kluwer Academic Publishers, 1990.

....two stage simulated annealing, VLSI design automation. 2 Draft submitted for publication 1 INTRODUCTION The simulated annealing (SA) algorithm has proven to be an effective optimization tool in such diverse fields as VLSI computer aided design, image processing, and operations research [1, 4, 9, 11, 14, 19, 21, 25, 30, 32]. This stems from both its general applicability to a wide range of NP hard combinatorial optimization problems and that it consistently produces high quality approximate solutions for these problems. SA has only one significant disadvantage its typically very long computation time. There has ....

....produces high quality approximate solutions for these problems. SA has only one significant disadvantage its typically very long computation time. There has been considerable effort aimed at speeding up SA. Most of this work has concentrated on the development of faster cooling schedules [2, 8, 13, 19, 20, 25]. Another approach is two stage simulated annealing (TSSA) 9, 10, 14, 28, 29] For TSSA, a faster heuristic algorithm is used to replace the SA actions occurring at the highest temperatures in the cooling schedule. The heuristic is then followed by a conventional SA approach initiated at a lower ....

[Article contains additional citation context not shown here]

R.H.J.M. Otten and L.P.P.P. van Ginneken, The Annealing Algorithm, Kluwer Academic Publishers, Boston, MA, 1989.

No context found.

Ralph Otten and Lukas van Ginneken, The annealing algorithm, Kluwer academic publishers, 1989.

No context found.

R. H. J. M. Otten and L. P.P.P.van Ginneken, The Annealing Algorithm, Kluwer Academic Publishers, #1989#.

No context found.

R.H.J.M. Otten and L.P.P.P. van Ginneken. The Annealing Algorithm. Kluwer Academic Publishers, Boston, 1989.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC