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  (19)
  • 2000-2004  (18)
  • 1975-1979  (1)
  • Computer Science  (19)
Collection
  • Articles  (19)
Source
Keywords
Publisher
Years
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Optimization by space-densifying curves as a natural generalization of the Alienor method (2000)
    Bingley : Emerald
    Kybernetes 29 (2000), S. 746-754 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: The Alienor method offers a powerful approximation technique for the optimization of continuous multivariable functions defined on a compact set H of Rn. Its computational efficiency is completed by the fact that it gave rise to the theory of space-densifying curves. Presents a survey of these curves, analysing their most important properties and characteristics. Finally, the concept of theoretic calculation time (t.c.t.) associated with each curve suggests an interesting geometric problem on the existence of a curve with minimal t.c.t.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684920010333170
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Approximation of multiple integrals by length of -dense curves (2002)
    Bingley : Emerald
    Kybernetes 31 (2002), S. 1133-1147 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: The authors have developed a new method for approximating multiple integrals. This new method is based on Alienor method which use a-dense curves. Double and triple integrals have been approximated by densification of the domain. In this paper, the aim is to prove by different ways the theory elaborated in earlier researches.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684920210436381
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Global optimization-preserving operators (2003)
    Bingley : Emerald
    Kybernetes 32 (2003), S. 1473-1480 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: In this paper, some kinds of operators, defined on a class of real functions depending on a single real variable, preserving some fundamental properties for solving global optimization problems are introduced. These operators allow the transfer of the search of the global extremum of a determined objective function, f into those of its transformed function, Tf, for which a global extremum is easy to obtain.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684920310493369
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Approximating multiple integrals via -dense curves (2002)
    Bingley : Emerald
    Kybernetes 31 (2002), S. 292-304 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: This paper is intended to provide a numerical method for computing integrals of several variables. The method is based on a intuitive geometric idea relative to the meaning of densifying a domain in Rn+1(n=1) by a curve h(t), contained in that domain, say K, with a very small density a (this must be interpreted as the following property: for any point of K there exists a point of the curve at distance less or equal than a).Thus, the method states that any area, volume, etc, can be computed as the limit of the length of a certain curve, densifying that domain, multiplied by a power of its density. Therefore, the computation of a multiple integral of a nonnegative continuous function can be approached by a simple integral corresponding to the length of the curve h(t) and certain power of its density.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684920210419010
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    The existence of a-dense curves with minimal length in a metric space (2000)
    Bingley : Emerald
    Kybernetes 29 (2000), S. 219-230 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Some results concerning the existence of a-dense curves with minimal length are given. This type of curves used in the reducing transformation called Alienor was invented by Cherruault and Guillez. They have been applied to global optimization in the following way: a multivariable optimization problem is transformed in an optimization problem depending on a single variable. Then this idea was extended by Cherruault and his team for obtaining general classes of reducing transformations having minimal properties (length of the a-dense curves, minimization of the calculus time, etc.).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684920010312803
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    A new method for calculating multiple integrals (2002)
    Bingley : Emerald
    Kybernetes 31 (2002), S. 124-129 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Gives a new method for defining and calculating multiple integrals. More precisely proposes that it is possible to define a multiple integral by means of a simple integral. This can be performed by using a-dense curves in Rn, already introduced for global optimization using the ALIENOR method.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684920210413809
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Approximation of multiple integrals by simple integrals involving periodic functions (2004)
    Bingley : Emerald
    Kybernetes 33 (2004), S. 1472-1490 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: In this paper, we consider problems of numerical integration of fast oscillatory functions of one variable, obtained by using a-dense curves and approximating multiple integrals. Using first, periodic and regular a-dense curves we propose a trapezoidal formula for calculating the periodic integrand obtained. Then, we consider the simple integrals as integrals with weight. We propose a method to evaluate the moments of the weight function. This allows us to build a recurrent formula for the orthogonal polynomials family and to use a Gaussian rule to estimate the simple integral. Finally, we adapt the Filon's method, consisting in evaluating the Fourier coefficients of a function, to the oscillatory integrand obtained by using reducing transformations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684920410534470
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    An Integrated Telepresence Environment for Collaboration in Construction (2000)
    Springer
    Engineering with computers 16 (2000), S. 287-305 
    Details
    ISSN: 1435-5663
    Keywords: Keywords:Collaborative environments; Concurrent engineering; Meeting environments; Telepresence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: For construction projects involving transient ‘virtual organisations’ composed of non-collocated team-members, the adoption of concurrent engineering principles is seen as vital. An important aspect of concurrent engineering in construction is the need for an effective communications infrastructure between team members. Traditionally, such communication has been handled through person-to-person meetings, however the complexity of construction projects has grown and, as a result, reliance on new information and communications technologies is becoming increasingly necessary. Hence, within a concurrent engineering setting, there is the need for an integrated information and collaboration environment that will create a persistent space to support interaction between project personnel throughout all phases of construction projects. This joint initiative between the Massachusetts Institute of Technology (MIT), Loughborough University, British Telecommunications plc. (BT) and Kajima Corporation explores computer-supported mechanisms for enhancing distributed engineering collaboration. The goal of this paper is to develop a set of requirements, a system architecture and a system prototype to facilitate computer-supported collaboration among distributed teams. The prototype consists of a comprehensive working collaborative system built from the integration of complementary standalone applications. These applications are the CAIRO system, developed at the Massachusetts Institute of Technology and the Telepresence system developed by Loughborough University and BT.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00013717
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Effective Fitness as an Alternative Paradigm for Evolutionary Computation I: General Formalism (2000)
    Springer
    Genetic programming and evolvable machines 1 (2000), S. 363-378 
    Details
    ISSN: 1573-7632
    Keywords: effective fitness ; fitness landscape ; evolution equations ; genotype–phenotype map ; induced symmetry breaking
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In evolutionary computation the concept of a fitness landscape has played an important role, evolution itself being portrayed as a hill-climbing process on a rugged landscape. In this article we review the recent development of an alternative paradigm for evolution on a fitness landscape—effective fitness. It is shown that in general, in the presence of other genetic operators such as mutation and recombination, hill-climbing is the exception rather than the rule; a discrepancy that has its origin in the different ways in which the concept of fitness appears—as a measure of the number of fit offspring, or as a measure of the probability to reach reproductive age. Effective fitness models the former not the latter and gives an intuitive way to understand population dynamics as flows on an effective fitness landscape when genetic operators other than reproductive selection play an important role. Additionally, we will show that when the genotype-phenotype map is degenerate, i.e. there exists a synonym symmetry, it can be used to quantify the degree of symmetry breaking of the map, thus allowing for a quantitative explanation of phenomena such as self-adaptation, bloat and evolutionary robustness.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1010017207202
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    facet.materialart.
    Unknown
    Growing support vector classifiers with controlled complexity (2003)
    Elsevier
    Details
    Publication Date: 2003-07-01
    Print ISSN: 0031-3203
    Electronic ISSN: 1873-5142
    Topics: Computer Science
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...