D. Baumeister et al., http://wwwasic.ihep.uni-heidelberg.de/h1cip/, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Information Exchange in Multi Colony Ant Algorithms - Middendorf, Reischle, Schmeck (2000) (1 citation) (Correct)
....in the ring. The m best best of these 2m best ants are allowed to update the pheromone matrix. 4. Circular exchange of locally best solutions plus migrants: Combination of (2) and (3) 5 Results We tested our information exchange strategies on a TSP instance with 101 cities from the TSPLIB [15] (The chosen instance is eil101) The length of the shortest tour for this instance is known to be 629. The parameters used for the test runs are: ff = 1, fi = 5, ae = 0:95, Q = 100, e = 10. All runs were done with m = 100 ants that are split into N 2 f1; 5; 10; 20g colonies. The number m best of ....
http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB/TSPLIB.html
New Results on Alternating and Non-Deterministic.. - Kari, Moore (2001) (1 citation) (Correct)
....to the regular languages in one dimension, in two or more dimensions they become distinct: DFA NFA AFA REC where all of these inclusions are strict. We recommend [LMN98,GR96,IT91,Ros79] for reviews of these classes. A bibliography of papers in the subject is maintained by Borchert at [BB]. Note that we restrict our automata to move within the picture they are trying to recognize. For DFAs, it is known that allowing them to move outside the picture into a eld of blanks does not increase their computational power [Ros79] For NFAs this is known for 1 n pictures [LMN98] and for ....
B. Borchert, http://math.uni-heidelberg.de/logic/bb/2dpapers.html
The Higher Derivative Expansion of the Effective.. - Fliegner, Haberl.. (Correct)
....analogy to the Polyakov path integral, i.e. using one dimensional perturbation theory. This reformulation turned out to be well suited to the calculation of one loop effective actions in general ( 21 26] see also [27] and highly efficient for the calculation of their inverse mass expansions [28 32]. The inverse mass expansion (or, more generally, the higher derivative expansion) is a standard tool for the approximative calculation of one loop effective actions, and considerable work has gone into the determination of its coefficients. It is applied in fields as different as chiral ....
....we chose a new system for symbolic manipulation called M [48] which turned out to be much faster than comparably flexible systems. We also used M in performing the integrations in the general case. The coefficients were calculated to order O(T 12 ) in the pure scalar case (they can be found at [32]) and to order O(T 6 ) in the general case. After the reduction into the minimal basis the results to order O(T 5 ) read (absorbing the coupling constant g into the fields, F j D D F etc. O 1 = V O 2 = V 2 1 6 F F 6 O 3 = V 3 1 2 V V 1 2 V F F 1 20 F F Gamma ....
http://www.thphys.uni-heidelberg.de/~fliegner .
The Bad and the Good-and-Ugly: Formulations for the Traveling.. - Pataki (2000) (Correct)
....of the MTZ formulation onto the space of the x variables are of the form (3.4) Empirically A simple computational experiment can truly convince skeptical students about the respective utility of the formulations. We considered relatively small, but nontrivial asymmetric TSP instances from [TSPLIB]. The problem parameters are given in Table 3. The reason for considering the asymmetric TSP is that the MTZ formulation is tailored for it; one might argue that converting a symmetric instance to an asymmetric one by adding two arcs for every edge would give undue advantage to the subtour ....
http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/ 6
Rectangles and Squares Recognized By Two-Dimensional Automata - Kari, Moore (Correct)
....[5] While DFAs, NFAs and h(LLL)s are equivalent in one dimension, in two or more they become distinct: DFA # NFA # h(LLL) where these inclusions are strict. Reviews of these classes are given in [8, 4, 7, 11] and a bibliography of papers in the subject is maintained by Borchert at [2]. A fair amount is known about the closure properties of these classes as well. The DFA, NFA, and h(LLL) languages are all closed under intersection and union using straightforward constructions. The situation for complement is somewhat more complicated. DFAs are closed under complement by an ....
B. Borchert, http://math.uni-heidelberg.de/logic/bb/2dpapers.html
Application of the Worldline Path Integral Method.. - Fliegner, Haberl.. (Correct)
....in the form Gamma[F; V ] Z 1 0 dT T [4 T ] Gammad=2 e Gammam 2 T 1 X n=1 ( GammaT ) n n Z dx 0 tr O n : 12) The factor [4 T ] Gammad=2 arises from the normalization of the free path integral. For the scalar case the calculation of the coefficients was done up to O 11 [8, 9]. In the following we describe the basis reduction algorithm for the gauge case as proposed by Muller [10] It turns out that there is a minimal basis of invariants without box operators and partial integrations are still not necessary to reduce our results into this basis. However, besides the ....
.... Up to O(T 5 ) the results have been checked to be equivalent with the result obtained from a modified non recursive heat kernel method [13] Additionally, a check with the results of [1] has been done up to O(T 4 ) The expression for O 5 is too large to be presented here and can be found in [9]. The results to O(T 4 ) read (absorbing the coupling constant g into the fields, F j D D F etc. O 1 = V ; O 2 = V 2 1 6 F F ; O 3 = V 3 1 2 V V 1 2 V F F Gamma 2 15 i F F F 1 20 F F ; O 4 = V 4 2V V V 1 5 V V 3 5 V 2 F F 2 5 V F V ....
available at http://www.thphys.uni-heidelberg.de/~fliegner
Chaos and Optimization - From Numerical Algorithm to Hardware .. - Ikeguchi, Horio (Correct)
....both numerical algorithms with chaotic neural networks and hardware implementation. I. Chaos for avoiding local minima A. Mutual Connection Neural Network Dynamics Various methods are proposed for solving NP hard combinatorial optimization problems, for example, traveling salesman problem (TSP) [2] 1 , quadratic assignment problems (QAP) 3] 2 , and so on. One of the novel approaches, called modern heuristics, solves TSP with neural network dynamics. The basic concept of this approach was formulated by Hopfield and Tank [1] They applied dynamics of the mutual connection neural ....
TSPLIB http://www.iwr.uni-heidelberg.de/iwr/ comopt /soft/ TSPLIB95/TSPLIB.html.
Compact Frontend--Electronics and Bidirectional 3.3 Gbps.. - For The Experiment (Correct)
No context found.
D. Baumeister et al., http://wwwasic.ihep.uni-heidelberg.de/h1cip/, 1999.
Particle Physics at LHC/CMS - Amsler, Glättli, Kaufmann.. (1998) (Correct)
No context found.
available at: http://www.physi.uni-heidelberg.de/groups/herab/MSGC Info.html. REFERENCES 25
The On-line Bibliographical Data Base ARIBIB for.. - Demleitner.. (1998) (Correct)
No context found.
http://www.ari.uni-heidelberg.de/aribib
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