ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (27)
  • simulated annealing  (27)
  • Springer  (27)
  • American Chemical Society
  • 1995-1999  (27)
  • Computer Science  (27)
  • Natural Sciences in General
  • 1
    Electronic Resource
    Electronic Resource
    System Level Hardware/Software Partitioning Based on Simulated Annealing and Tabu Search (1997)
    Springer
    Design automation for embedded systems 2 (1997), S. 5-32 
    Details
    ISSN: 1572-8080
    Keywords: Hardware/software partitioning ; co-synthesis ; iterative improvement heuristics ; simulated annealing ; tabu search
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents two heuristics for automatic hardware/software partitioning of system level specifications. Partitioning is performed at the granularity of blocks, loops, subprograms, and processes with the objective of performance optimization with a limited hardware and software cost. We define the metric values for partitioning and develop a cost function that guides partitioning towards the desired objective. We consider minimization of communication cost and improvement of the overall parallelism as essential criteria during partitioning. Two heuristics for hardware/software partitioning, formulated as a graph partitioning problem, are presented: one based on simulated annealing and the other on tabu search. Results of extensive experiments, including real-life examples, show the clear superiority of the tabu search based algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008857008151
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Automatic unstructured grid generation based on iterative point insertion (1995)
    Springer
    Computing 55 (1995), S. 135-161 
    Details
    ISSN: 1436-5057
    Keywords: 65D17 ; 68U05 ; Approximation ; grid generation ; interpolation ; simulated annealing ; triangulation ; unstructured grid generation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Unstrukturierte Diskretisierungsverfahren dienen der diskreten Beschreibung von Flächen und Volumina in Form von Dreiecken und Tetraedern. Tetraeder werden zur Diskretisierung eines Volumens benutzt, das auf der Innen- oder Außenseite einer vorgegebenen Fläche liegt. Diese Arbeit behandelt ein automatisches Verfahren zur Generierung von Tetraedern. Das Verfahren basiert auf einem Schnittalgorithmus, der Geraden mit einer vorgegebenen Fläche schneidet und iterative Punkte einfügt. Die resultierende Punktdichte nimmt mit Zunehmender Distanz zur Fläche ab.
    Notes: Abstract Unstructured grid generation is concerned with discretizing surfaces and volumes in 3D space by triangles and tetrahedra. The tetrahedra discretize a volume in a surface's interior or surrounding a surface on its outside. This paper presents a new technique for unstructured grid generation based on intersecting lines with a given geometry and inserting grid points yielding an adapted grid whose point density decreases with increasing distance to the geometry. The technique is completely automatic.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02238098
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Chromosome Reconstruction from Physical Maps Using a Cluster of Workstations (1997)
    Springer
    The journal of supercomputing 11 (1997), S. 61-86 
    Details
    ISSN: 1573-0484
    Keywords: simulated annealing ; microcanonical annealing ; parallel processing ; chromosome reconstruction ; clone ordering
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is shown to be isomorphic to the classical NP-complete Optimal Linear Arrangement problem. Parallel algorithms for simulated annealing and microcanonical annealing based on Markov chain decomposition are proposed and applied to the problem of chromosome reconstruction via clone ordering. These algorithms are implemented on a cluster of UNIX workstations using the Parallel Virtual Machine (PVM) system. PVM is a software system that permits a heterogeneous collection of networked computers to be viewed by a user's program as a single monolithic parallel computing resource. The parallel algorithms are implemented and tested on clonal data derived from Chromosome IV of the fungus Asperigillus nidulans Perturbation methods and problem-specific annealing heuristics for the parallel simulated annealing and parallel microcanonical annealing algorithms are proposed and described. Convergence, speedup and scalability characteristics of the various parallel algorithms are analyzed and discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1007913429509
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    A Fast Approach for Robot Motion Planning (1999)
    Springer
    Journal of intelligent and robotic systems 25 (1999), S. 187-212 
    Details
    ISSN: 1573-0409
    Keywords: robot motion planning ; inverse kinematics ; potential filed ; simulated annealing ; pseudoinverse
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract This paper describes a new approach to robot motion planning that combines the end-point motion planning with joint trajectory planning for collision avoidance of the links. Local and global methods are proposed for end-point motion planning. The joint trajectory planning is achieved through a pseudoinverse kinematic formulation of the problem. This approach enables collision avoidance of the links by a fast null-space vector computation. The power of the proposed planner derives from: its speed; the good properties of the potential function for end-point motion planning; and from the simultaneous avoidance of the links collision, kinematic singularities, and local minima of the potential function. The planner is not defined over computationally expensive configuration space and can be applied for real-time applications. The planner shows to be faster than many previous planners and can be applied to robots with many degrees of freedom. The effectiveness of the proposed local and global planning methods as well as the general robot motion planning approach have been experimented using the computer-simulated robots. Some of the simulation results are included in this paper.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008028507522
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    An Introduction to Simulated Annealing Algorithms for the Computation of Economic Equilibrium (1998)
    Springer
    Computational economics 12 (1998), S. 151-169 
    Details
    ISSN: 1572-9974
    Keywords: economic equilibrium ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Economics
    Notes: Abstract Economic equilibrium computation has raised the issue of global optimization algorithms since economic equilibrium problems can be cast as a global optimization problem. However, nearly all conventional algorithms stop when they find a local optimum. Over the last decade a number of new optimization algorithms have appeared, simulated annealing is one of them. It is a powerful stochastic search algorithm applicable to a wide range of problems for which little prior knowledge is available, and it asymptotically probabilistically converges to a global optimum. In this paper, we will give a brief introduction to simulated annealing and apply it to the computation of economic equilibrium. We also reported our computational experience in the paper. This early result shows that the application of simulated annealing to computation of economic equilibrium is encouraging and it deserves further research.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008685129185
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Evolutionary Approaches to Figure-Ground Separation (1999)
    Springer
    Applied intelligence 11 (1999), S. 187-212 
    Details
    ISSN: 1573-7497
    Keywords: figure-ground separation ; evolutionary computation ; genetic algorithm ; simulated annealing ; microcanonical annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on relaxation and gradient descent-based search, and stochastic optimization techniques based on simulated annealing and microcanonical annealing. A mathematical model encapsulating the figure-ground separation problem that makes explicit the definition of shape in terms of attributes such as cocircularity, smoothness, proximity and contrast is described. The model is based on the formulation of an energy function that incorporates pairwise interactions between local image features in the form of edgels and is shown to be isomorphic to the interacting spin (Ising) system from quantum physics. This paper explores a class of stochastic optimization techniques based on evolutionary algorithms for the problem of figure-ground separation. A class of hybrid evolutionary stochastic optimization algorithms based on a combination of evolutionary algorithms, simulated annealing and microcanonical annealing are shown to exhibit superior performance when compared to their purely evolutionary counterparts and to classical simulated annealing and microcanonical annealing algorithms. Experimental results on synthetic edgel maps and edgel maps derived from gray scale images are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008328514385
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Discretisation of Continuous Commercial Database Features for a Simulated Annealing Data Mining Algorithm (1999)
    Springer
    Applied intelligence 11 (1999), S. 285-295 
    Details
    ISSN: 1573-7497
    Keywords: discretisation ; data mining ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An introduction to the approaches used to discretise continuous database features is given, together with a discussion of the potential benefits of such techniques. These benefits are investigated by applying discretisation algorithms to two large commercial databases; the discretisations yielded are then evaluated using a simulated annealing based data mining algorithm. The results produced suggest that dramatic reductions in problem size may be achieved, yielding improvements in the speed of the data mining algorithm. However, it is also demonstrated under certain circumstances that the discretisation produced may give an increase in problem size or allow overfitting by the data mining algorithm. Such cases, within which often only a small proportion of the database belongs to the class of interest, highlight the need both for caution when producing discretisations and for the development of more robust discretisation algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008339026836
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Massively Parallel Probabilistic Reasoning with Boltzmann Machines (1999)
    Springer
    Applied intelligence 11 (1999), S. 31-44 
    Details
    ISSN: 1573-7497
    Keywords: Boltzmann machines ; probabilistic reasoning ; Bayesian networks ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model probably converges to a state which can be mapped back to a maximum a posteriori (MAP) probability state in the probability distribution represented by the Bayesian network. The Boltzmann machine model can be implemented efficiently on massively parallel hardware, since the resulting structure can be divided into two separate clusters where all the nodes in one cluster can be updated simultaneously. This means that the proposed mapping can be used for providing Bayesian network models with a massively parallel probabilistic reasoning module, capable of finding the MAP states in a computationally efficient manner. From the neural network point of view, the mapping from a Bayesian network to a Boltzmann machine can be seen as a method for automatically determining the structure and the connection weights of a Boltzmann machine by incorporating high-level, probabilistic information directly into the neural network architecture, without recourse to a time-consuming and unreliable learning process.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008324530006
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Feature Subset Selection within a Simulated Annealing Data Mining Algorithm (1997)
    Springer
    Journal of intelligent information systems 9 (1997), S. 57-81 
    Details
    ISSN: 1573-7675
    Keywords: Feature subset selection ; data mining ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An overview of the principle feature subset selection methods isgiven. We investigate a number of measures of feature subset quality, usinglarge commercial databases. We develop an entropic measure, based upon theinformation gain approach used within ID3 and C4.5 to build trees, which isshown to give the best performance over our databases. This measure is usedwithin a simple feature subset selection algorithm and the technique is usedto generate subsets of high quality features from the databases. A simulatedannealing based data mining technique is presented and applied to thedatabases. The performance using all features is compared to that achievedusing the subset selected by our algorithm. We show that a substantialreduction in the number of features may be achieved together with animprovement in the performance of our data mining system. We also present amodification of the data mining algorithm, which allows it to simultaneouslysearch for promising feature subsets and high quality rules. The effect ofvarying the generality level of the desired pattern is alsoinvestigated.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008641220268
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Query Optimization in Multidatabase Systems (1998)
    Springer
    Distributed and parallel databases 6 (1998), S. 183-210 
    Details
    ISSN: 1573-7578
    Keywords: database ; multidatabase ; query optimization ; simulated annealing ; heuristics and combinatorial optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Global query execution in a multidatabase system can be done parallelly, as all the local databases are independent. In this paper, a cost model that considers parallel execution of subqueries for a global query is developed. In order to obtain maximum parallelism in query execution, it is required to find a query execution plan that is represented in the form of a bushy tree and this query tree should be balanced to the maximal possible extent with respect to execution time. A new bottom up approach called Agglomerative Approach (AA) is proposed to construct balanced bushy trees with respect to execution time. By the deterministic nature of this approach, it generates local optimal solutions. This local minima problem will be severe in the case of graph queries, i.e., queries that are represented with a graph structure. A Simulated annealing Approach (SA) is employed to obtain a (near) optimal solution. These approaches (AA and SA) are suitable for handling on-line and off-line queries respectively. A Hybrid Approach (HA), that is an integration of AA and SA, is proposed to optimize queries for which the estimated time to be spent on optimization is known a priori. Results obtained with AA and SA on both tree and graph structured queries are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008691331104
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 11
    Electronic Resource
    Electronic Resource
    A New Table of Binary/Ternary Mixed Covering Codes (1997)
    Springer
    Designs, codes and cryptography 11 (1997), S. 151-178 
    Details
    ISSN: 1573-7586
    Keywords: covering codes ; football pool problem ; mixed codes ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A table of upper bounds for K3,2(n1,n2;R), the minimum number of codewords in a covering code with n1 ternary coordinates, n2 binary coordinates, and covering radius R, in the range n = n1 + n2 ≤ 13, R ≤ 3, is presented. Explicit constructions of codes are given to prove the new bounds and verify old bounds. These binary/ternary covering codes can be used as systems for the football pool game. The results include a new binary code with covering radius 1 proving K2(13,1) ≤ 736, and the following upper bound for the football pool problem for 9 matches: K3(9,1) ≤ 1356.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008228721072
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    Multicasting VP design methodology using simulated annealing in an ATM network (1996)
    Springer
    Journal of network and systems management 4 (1996), S. 133-153 
    Details
    ISSN: 1573-7705
    Keywords: High-speed network management ; ATM network management ; multipoint virtual paths design ; optimization ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Multicast routing over semi-permanent VP (virtual path)s in an ATM (asynchronous transfer mode)-based B-ISDN (broadband integrated services digital network) determines a set of VPs connecting from a source node to destination nodes. The problem of finding the optimal constrained multicasting tree over the semi-permanent VPs in an ATM network is known to be NP (nondeterministic polynomial time)-complete. We develop an optimization methodology for searching a constrained multicast routing tree with minimum cost, using simulated annealing technique. We define the problem-dependent components such as state space and cost function, and refine the implementation-dependent factors including initial temperature and cooling schedule. The simulation results show that our optimization methodology demonstrates good behavior in terms of performance on a variety of graphs modeling the sample ATM networks.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02139131
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    A Comparative Survey of Automated Parameter-Search Methods for Compartmental Neural Models (1999)
    Springer
    Journal of computational neuroscience 7 (1999), S. 149-171 
    Details
    ISSN: 1573-6873
    Keywords: parameter search ; compartmental model ; genetic algorithm ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Medicine , Physics
    Notes: Abstract One of the most difficult and time-consuming aspects of building compartmental models of single neurons is assigning values to free parameters to make models match experimental data. Automated parameter-search methods potentially represent a more rapid and less labor-intensive alternative to choosing parameters manually. Here we compare the performance of four different parameter-search methods on several single-neuron models. The methods compared are conjugate-gradient descent, genetic algorithms, simulated annealing, and stochastic search. Each method has been tested on five different neuronal models ranging from simple models with between 3 and 15 parameters to a realistic pyramidal cell model with 23 parameters. The results demonstrate that genetic algorithms and simulated annealing are generally the most effective methods. Simulated annealing was overwhelmingly the most effective method for simple models with small numbers of parameters, but the genetic algorithm method was equally effective for more complex models with larger numbers of parameters. The discussion considers possible explanations for these results and makes several specific recommendations for the use of parameter searches on neuronal models.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008972005316
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    Sampling from multimodal distributions using tempered transitions (1996)
    Springer
    Statistics and computing 6 (1996), S. 353-366 
    Details
    ISSN: 1573-1375
    Keywords: Markov chain Monte Carlo ; simulated tempering ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract I present a new Markov chain sampling method appropriate for distributions with isolated modes. Like the recently developed method of ‘simulated tempering’, the ‘tempered transition’ method uses a series of distributions that interpolate between the distribution of interest and a distribution for which sampling is easier. The new method has the advantage that it does not require approximate values for the normalizing constants of these distributions, which are needed for simulated tempering, and can be tedious to estimate. Simulated tempering performs a random walk along the series of distributions used. In contrast, the tempered transitions of the new method move systematically from the desired distribution, to the easily-sampled distribution, and back to the desired distribution. This systematic movement avoids the inefficiency of a random walk, an advantage that is unfortunately cancelled by an increase in the number of interpolating distributions required. Because of this, the sampling efficiency of the tempered transition method in simple problems is similar to that of simulated tempering. On more complex distributions, however, simulated tempering and tempered transitions may perform differently. Which is better depends on the ways in which the interpolating distributions are ‘deceptive’.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00143556
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 15
    Electronic Resource
    Electronic Resource
    Partially-latinized designs (1999)
    Springer
    Statistics and computing 9 (1999), S. 203-207 
    Details
    ISSN: 1573-1375
    Keywords: A-optimality ; average efficiency factor ; interchange algorithm ; latinized designs ; (M,S)-optimality ; resolvable designs ; row-column designs ; simulated annealing ; upper bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An interchange optimization algorithm to construct partially-latinized designs is described. The objective function is a weighted linear combination of up to five functions, each of which corresponds to a blocking factor of the required design. Nested simulated annealing is used to address local optima problems. The average efficiency factors of the generated designs are assessed against theoretical upper bounds.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008969914035
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 16
    Electronic Resource
    Electronic Resource
    Computational experience with general equilibrium problems (1996)
    Springer
    Computational optimization and applications 6 (1996), S. 213-225 
    Details
    ISSN: 1573-2894
    Keywords: economic equilibrium ; piecewise-linear homotopy methods ; simulated annealing ; variational inequalities ; projection method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We report on computational experience with an implementation of three algorithms for the general economic equilibrium problem. As a result we get that the projection algorithm for variational inequalities increases the size of solvable models by a factor of 5–10 in comparison with the classical homotopy method. As a third approach we implemented a simulated annealing heuristic which might be suitable to estimate equilibria for very large models.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00247792
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 17
    Electronic Resource
    Electronic Resource
    Metaheuristics for High School Timetabling (1998)
    Springer
    Computational optimization and applications 9 (1998), S. 275-298 
    Details
    ISSN: 1573-2894
    Keywords: timetable problem ; tabu search ; simulated annealing ; genetic algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper we present the results of an investigation of the possibilities offered by three well-known metaheuristic algorithms to solve the timetable problem, a multi-constrained, NP-hard, combinatorial optimization problem with real-world applications. First, we present our model of the problem, including the definition of a hierarchical structure for the objective function, and of the neighborhood search operators which we apply to matrices representing timetables. Then we report about the outcomes of the utilization of the implemented systems to the specific case of the generation of a school timetable. We compare the results obtained by simu lated annealing, tabu search and two versions, with and without local search, of the genetic algorithm. Our results show that GA with local search and tabu search based on temporary problem relaxations both outperform simulated annealing and handmade timetables.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018354324992
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 18
    Electronic Resource
    Electronic Resource
    A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems (1999)
    Springer
    Computational optimization and applications 14 (1999), S. 103-132 
    Details
    ISSN: 1573-2894
    Keywords: global optimization ; integer and mixed integer programming problems ; controlled random search ; simulated annealing ; relative performance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, a computational algorithm, named RST2ANU algorithm, has been developed for solving integer and mixed integer global optimization problems. This algorithm, which primarily is based on the original controlled random search approach of Price [22i], incorporates a simulated annealing type acceptance criterion in its working so that not only downhill moves but also occasional uphill moves can be accepted. In its working it employs a special truncation procedure which not only ensures that the integer restrictions imposed on the decision variables are satisfied, but also creates greater possibilities for the search leading to a global optimal solution. The reliability and efficiency of the proposed RST2ANU algorithm has been demonstrated on thirty integer and mixed integer optimization problems taken from the literature. The performance of the algorithm has been compared with the performance of the corresponding purely controlled random search based algorithm as well as the standard simulated annealing algorithm. The performance of the method on mathematical models of three realistic problems has also been demonstrated.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008761113491
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 19
    Electronic Resource
    Electronic Resource
    Annealing Algorithms for Multisource Absolute Location Problems on Graph (1997)
    Springer
    Computational optimization and applications 7 (1997), S. 325-337 
    Details
    ISSN: 1573-2894
    Keywords: combinatorial optimization ; location problems ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A methodology is presented for applying annealing techniques tomultisource absolute location problems on graph. Two kinds ofobjective functions are considered: barycenters and centers. Aclass of new algorithms is described: its development startsfrom the iterative “cluster-and-locate” algorithm and reliesupon the relaxation of the integrality constraints onallocation variables. Experimental results are reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008612929672
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 20
    Electronic Resource
    Electronic Resource
    A simulated annealing version of the EM algorithm for non-Gaussian deconvolution (1997)
    Springer
    Statistics and computing 7 (1997), S. 229-236 
    Details
    ISSN: 1573-1375
    Keywords: EM algorithm ; deconvolution ; linear filters ; stochastic algorithms ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Expectation–Maximization (EM) algorithm is a very popular technique for maximum likelihood estimation in incomplete data models. When the expectation step cannot be performed in closed form, a stochastic approximation of EM (SAEM) can be used. Under very general conditions, the authors have shown that the attractive stationary points of the SAEM algorithm correspond to the global and local maxima of the observed likelihood. In order to avoid convergence towards a local maxima, a simulated annealing version of SAEM is proposed. An illustrative application to the convolution model for estimating the coefficients of the filter is given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018594320699
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 21
    Electronic Resource
    Electronic Resource
    On shape detection in noisy images with particular reference to ultrasonography (1998)
    Springer
    Statistics and computing 8 (1998), S. 377-389 
    Details
    ISSN: 1573-1375
    Keywords: cascade algorithm ; edge detection ; ICM ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We discuss the detection of a connected shape in a noisy image. Two types of image are considered: in the first a degraded outline of the shape is visible, while in the second the data are a corrupted version of the shape itself. In the first type the shape is defined by a thin outline of pixels with records that are different from those at pixels inside and outside the shape, while in the second type the shape is defined by its edge and pixels inside and outside the shape have different records. Our motivation is the identification of cross-sectional head shapes in ultrasound images of human fetuses. We describe and discuss a new approach to detecting shapes in images of the first type that uses a specially designed filter function that iteratively identifies the outline pixels of the head. We then suggest a way based on the cascade algorithm introduced by Jubb and Jennison (1991) of improving and considerably increasing the speed of a method proposed by Storvik (1994) for detecting edges in images of the second type.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008884808076
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 22
    Electronic Resource
    Electronic Resource
    An algorithm for the design of factorial experiments when the data are correlated (1999)
    Springer
    Statistics and computing 9 (1999), S. 195-201 
    Details
    ISSN: 1573-1375
    Keywords: Factorial design ; optimal design ; run order dependence ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Since the development of methods for the analysis of experiments with dependent data, see for example Gleeson and Cullis (1987), the design of such experiments has been an area of active research. We investigate the design of factorial experiments, complete and fractional, for various dependency structures. An algorithm for generating optimal or near optimal designs is presented and shown to be useful across a wide range of dependency structures.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008965829964
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 23
    Electronic Resource
    Electronic Resource
    The Slack Method: A New Method for Static Allocation of Hard Real-Time Tasks (1998)
    Springer
    Real-time systems 15 (1998), S. 103-130 
    Details
    ISSN: 1573-1383
    Keywords: allocation ; mapping ; multiprocessor scheduling ; parallel systems ; distributed systems ; simulated annealing ; genetic algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This article presents and evaluates the Slack Method, a new constructive heuristic for the allocation (mapping) of periodic hard real-time tasks to multiprocessor or distributed systems. The Slack Method is based on task deadlines, in contrast with other constructive heuristics, such as List Processing. The presented evaluation shows that the Slack Method is superior to list-processing-based approaches with regard to both finding more feasible solutions as well as finding solutions with better objective function values. In a comparative survey we evaluate the Slack Method against several alternative allocation techniques. This includes comparisons with optimal algorithms, non-guided search heuristics (e.g. Simulated Annealing), and other constructive heuristics. The main practical result of the comparison is that a combination of non-guided search and constructive approaches is shown to perform better than either of them alone, especially when using the Slack Method.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008092427865
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 24
    Electronic Resource
    Electronic Resource
    A study of simulated annealing and a revised cascade algorithm for image reconstruction (1995)
    Springer
    Statistics and computing 5 (1995), S. 175-190 
    Details
    ISSN: 1573-1375
    Keywords: Image analysis ; MAP estimation ; optimization ; simulated annealing ; multi-resolution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We describe an image reconstruction problem and the computational difficulties arising in determining the maximum a posteriori (MAP) estimate. Two algorithms for tackling the problem, iterated conditional modes (ICM) and simulated annealing, are usually applied pixel by pixel. The performance of this strategy can be poor, particularly for heavily degraded images, and as a potential improvement Jubb and Jennison (1991) suggest the cascade algorithm in which ICM is initially applied to coarser images formed by blocking squares of pixels. In this paper we attempt to resolve certain criticisms of cascade and present a version of the algorithm extended in definition and implementation. As an illustration we apply our new method to a synthetic aperture radar (SAR) image. We also carry out a study of simulated annealing, with and without cascade, applied to a more tractable minimization problem from which we gain insight into the properties of cascade algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00142660
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 25
    Electronic Resource
    Electronic Resource
    Comparison of a genetic algorithm and simulated annealing in an application to statistical image reconstruction (1997)
    Springer
    Statistics and computing 7 (1997), S. 193-207 
    Details
    ISSN: 1573-1375
    Keywords: Genetic algorithms ; simulated annealing ; MAP image estimation ; crossover ; hybrid algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Genetic algorithms (GAs) are adaptive search techniques designed to find near-optimal solutions of large scale optimization problems with multiple local maxima. Standard versions of the GA are defined for objective functions which depend on a vector of binary variables. The problem of finding the maximum a posteriori (MAP) estimate of a binary image in Bayesian image analysis appears to be well suited to a GA as images have a natural binary representation and the posterior image probability is a multi-modal objective function. We use the numerical optimization problem posed in MAP image estimation as a test-bed on which to compare GAs with simulated annealing (SA), another all-purpose global optimization method. Our conclusions are that the GAs we have applied perform poorly, even after adaptation to this problem. This is somewhat unexpected, given the widespread claims of GAs' effectiveness, but it is in keeping with work by Jennison and Sheehan (1995) which suggests that GAs are not adept at handling problems involving a great many variables of roughly equal influence. We reach more positive conclusions concerning the use of the GA's crossover operation in recombining near-optimal solutions obtained by other methods. We propose a hybrid algorithm in which crossover is used to combine subsections of image reconstructions obtained using SA and we show that this algorithm is more effective and efficient than SA or a GA individually.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018538202952
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 26
    Electronic Resource
    Electronic Resource
    Reparameterization strategies for hidden Markov models and Bayesian approaches to maximum likelihood estimation (1998)
    Springer
    Statistics and computing 8 (1998), S. 145-158 
    Details
    ISSN: 1573-1375
    Keywords: Bounded likelihood ; identifiability ; Gibbs sampler ; non-informative prior ; normal distribution ; Poisson distribution ; prior feedback ; proper posterior distribution ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper synthesizes a global approach to both Bayesian and likelihood treatments of the estimation of the parameters of a hidden Markov model in the cases of normal and Poisson distributions. The first step of this global method is to construct a non-informative prior based on a reparameterization of the model; this prior is to be considered as a penalizing and bounding factor from a likelihood point of view. The second step takes advantage of the special structure of the posterior distribution to build up a simple Gibbs algorithm. The maximum likelihood estimator is then obtained by an iterative procedure replicating the original sample until the corresponding Bayes posterior expectation stabilizes on a local maximum of the original likelihood function.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008938201645
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 27
    Electronic Resource
    Electronic Resource
    On the design of optimal change-over experiments through multi-objective simulated annealing (1999)
    Springer
    Statistics and computing 9 (1999), S. 37-42 
    Details
    ISSN: 1573-1375
    Keywords: change-over design ; dominance ; multi-objectives ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The construction of optimal designs for change-over experiments requires consideration of the two component treatment designs: one for the direct treatments and the other for the residual (carry-over) treatments. A multi-objective approach is introduced using simulated annealing, which simultaneously optimises each of the component treatment designs to produce a set of dominant designs in one run of the algorithm. The algorithm is used to demonstrate that a wide variety of change-over designs can be generated quickly on a desk top computer. These are generally better than those previously recorded in the literature.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008810109585
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...