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  (7)
  • simulated annealing  (7)
  • Springer  (7)
  • American Chemical Society
  • 1995-1999  (7)
  • 1997  (7)
  • Computer Science  (7)
Collection
  • Articles  (7)
Source
Keywords
Publisher
  • Springer  (7)
  • American Chemical Society
Years
  • 1995-1999  (7)
Year
Topic
  • 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
    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
  • 3
    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
  • 4
    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
  • 5
    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
  • 6
    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
  • 7
    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
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...