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
  • 1
    Electronic Resource
    Electronic Resource
    Learning Game-Specific Spatially-Oriented Heuristics (1998)
    Springer
    Constraints 3 (1998), S. 239-253 
    Details
    ISSN: 1572-9354
    Keywords: machine learning ; game playing ; spatial cognition ; extensible architectures
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper describes an architecture that begins with enough general knowledge to play any board game as a novice, and then shifts its decision-making emphasis to learned, game-specific, spatially-oriented heuristics. From its playing experience, it acquires game-specific knowledge about both patterns and spatial concepts. The latter are proceduralized as learned, spatially-oriented heuristics. These heuristics represent a new level of feature aggregation that effectively focuses the program's attention. While training against an external expert, the program integrates these heuristics robustly. After training it exhibits both a new emphasis on spatially-oriented play and the ability to respond to novel situations in a spatially-oriented manner. This significantly improves performance against a variety of opponents. In addition, we address the issue of context on pattern learning. The procedures described here move toward learning spatially-oriented heuristics for autonomous programs in other spatial domains.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009734028965
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The role of memory and concepts in learning (1992)
    Springer
    Minds and machines 2 (1992), S. 239-265 
    Details
    ISSN: 1572-8641
    Keywords: Representation ; cognitive architecture ; concepts ; machine learning ; game playing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract The extent to which concepts, memory, and planning are necessary to the simulation of intelligent behavior is a fundamental philosophical issue in Artificial Intelligence. An active and productive segement of the AI community has taken the position that multiple low-level agents, properly organized, can account for high-level behavior. Empirical research on these questions with fully operational systems has been restricted to mobile robots that do simple tasks. This paper recounts experiments with Hoyle, a system in a cerebral, rather than a physical, domain. The program learns to perform well and quickly, often outpacing its human creators at two-person, perfect information board games. Hoyle demonstrates that a surprising amount of intelligent behavior can be treated as if it were situation-determined, that often planning is unnecessary, and that the memory required to support this learning is minimal. Concepts, however, are crucial to this reactive program's ability to learn and perform.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02454222
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Toward an Ideal Trainer (1994)
    Springer
    Machine learning 15 (1994), S. 251-277 
    Details
    ISSN: 0885-6125
    Keywords: training ; competition ; game playing ; reliability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper demonstrates how the nature of the opposition during training affects learning to play two-person, perfect information board games. It considers different kinds of competitive training, the impact of trainer error, appropriate metrics for post-training performance measurement, and the ways those metrics can be applied. The results suggest that teaching a program by leading it repeatedly through the same restricted paths, albeit high quality ones, is overly narrow preparation for the variations that appear in real-world experience. The results also demonstrate that variety introduced into training by random choice is unreliable preparation, and that a program that directs its own training may overlook important situations. The results argue for a broad variety of training experience with play at many levels. This variety may either be inherent in the game or introduced deliberately into the training. Lesson and practice training, a blend of expert guidance and knowledge-based, self-directed elaboration, is shown to be particularly effective for learning during competition.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1022637925775
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Toward an ideal trainer (1994)
    Springer
    Machine learning 15 (1994), S. 251-277 
    Details
    ISSN: 0885-6125
    Keywords: training ; competition ; game playing ; reliability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper demonstrates how the nature of the opposition during training affects learning to play two-person, perfect information board games. It considers different kinds of competitive training, the impact of trainer error, appropriate metrics for post-training performance measurement, and the ways those metrics can be applied. The results suggest that teaching a program by leading it repeatedly through the same restricted paths, albeit high quality ones, is overly narrow preparation for the variations that appear in real-world experience. The results also demonstrate that variety introduced into training by random choice is unreliable preparation, and that a program that directs its own training may overlook important situations. The results argue for a broad variety of training experience with play at many levels. This variety may either be inherent in the game or introduced deliberately into the training. Lesson and practice training, a blend of expert guidance and knowledge-based, self-directed elaboration, is shown to be particularly effective for learning during competition.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00993346
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Kinetics of cooperative ligand-lattice binding: Fast Monte Carlo integration (1990)
    New York : Wiley-Blackwell
    Biopolymers 29 (1990), S. 543-547 
    Details
    ISSN: 0006-3525
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: A fast Monte Carlo integration algorithm with varying time step is described for cooperative binding of ligands of arbitrary length to a one-dimensional lattice. This algorithm is particularly suitable for strongly cooperative or anticooperative systems, i.e., when the time scales for different kinetic events are very different. As an application, the kinetics of a bimodal two-ligand system are briefly discussed.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/bip.360290309
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Studies on interaction between poly(L-lysine) and DNA of varied G + C contents (1975)
    New York : Wiley-Blackwell
    Biopolymers 14 (1975), S. 2401-2415 
    Details
    ISSN: 0006-3525
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Interaction between polylysine and DNA's of varied G + C contents was studied using thermal denaturation and circular dichroism (CD). For each complex there is one melting band at a lower temperature tm, corresponding to the helix-coil transition of free base pairs, and another band at a higher temperature t′m, corresponding to the transition of polylysine-bound base pairs. For free base pairs, with natural DNA's and poly(dA-dT) a linear relation is observed between the tm and the G + C content of the particular DNA used. This is not true with poly(dG)·poly(dC), which has a tm about 20°C lower than the extrapolated value for DNA of 100% G + C. For polylysine-bound base pairs, a linear relation is also observed between the t′m and the G + C content of natural DNA's but neither poly(dA-dT) nor poly(dG)·poly(dC) complexes follow this relationship. The dependence of melting temperature on composition, expressed as dtm/dXG·C, where XG·C is the fraction of G·C pairs, is 60°C for free base pairs and only 21°C for polylysine-bound base pairs. This reduction in compositional dependence of Tm is similar to that observed for pure DNA in high ionic strength. Although the t′m of polylysine-poly(dA-dT) is 9°C lower than the extrapolated value for 0% G + C in EDTA buffer, it is independent of ionic strength in the medium and is equal to the tm0 extrapolated from the linear plot of tm against log Na+. There is also a noticeable similarity in the CD spectra of polylysine· and polyarginine·DNA complexes, except for complexes with poly(dA-dT). The calculated CD spectrum of polylysine-bound poly(dA-dT) is substantially different from that of polyarginine-bound poly(dA-dT).
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/bip.1975.360141113
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Kinetics of large-ligand binding to one-dimensional lattices: theory of irreversible binding (1979)
    New York : Wiley-Blackwell
    Biopolymers 18 (1979), S. 765-788 
    Details
    ISSN: 0006-3525
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Exact solutions are obtained for the time dependence of the extent of irreversible binding of ligands that cover more than one lattice site to a homogeneous one-dimensional lattice. The binding may be cooperative or noncooperative and the lattice either finite or infinite. Although the form of the solution is most convenient when the ligand concentration is buffered, exact numerical or approximate analytical solutions, including upper and lower bounds, can be derived for the case of variable ligand concentration as well. The physical reason behind the relative simplicity of the kinetics of irreversible as opposed to reversible binding in such systems is discussed.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/bip.1979.360180404
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Kinetics of nucleic acid-large ligand interactions: Exact Monte Carlo treatment and limitingl cases of reversible binding (1979)
    New York : Wiley-Blackwell
    Biopolymers 18 (1979), S. 2037-2050 
    Details
    ISSN: 0006-3525
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Many ligands, including basic polypeptides, histones, and other proteins bind nonspecifically to DNA in such a way as to render unavailable for further binding several contiguous sites (generally bases or base pairs). An accurate description of the kinetics of such large ligand binding requires a more complex theoretical analysis than does the study of the binding of small ligands to DNA. An exact analytical solution of the problem does not appear feasible. Instead, a Monte Carlo approach is developed which provides an essentially exact numerical solution by simulating the binding experiment using a model one-dimensional lattice to represent the DNA molecule. For the limiting cases of totally irreversible binding and of instantaneous redistribution of bound ligands along the lattice, relatively simple equations can be written and solved for the binding kinetics. These solutions and their realms of applicability are discussed in some detail.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/bip.1979.360180815
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Kinetics of nucleic acid-large ligand interactions: Multiplet-closure approximations and matrix-iteration techniques (1981)
    New York : Wiley-Blackwell
    Biopolymers 20 (1981), S. 1651-1669 
    Details
    ISSN: 0006-3525
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Approximate methods are developed and evaluated for treating the rate of binding ligands that cover several contiguous sites to a homogeneous one-dimensional lattice, which represents a nucleic acid or other linear biopolymer. The model requires as input only the number of lattice sites necessary for binding, the total number (possibly infinite) of lattice sites, and elementary rate constants for the cooperative and noncooperative association and dissociation of the ligand on the lattice. The computational methods employed are an extension of the triplet closure approximation from the helix-coil (single-site ligand) problem to the large ligand binding problem. It is found that consideration of clusters of n + 2 lattice sites, where each ligand covers n sites, gives a surprisingly accurate description of the kinetics. The approximation is implemented by an extension of the matrix-iteration approach proposed by Craig and Crothers. The effects of the finite lattice length, as well as the capability to treat ligand motion along the lattice, are incorporated. When all symmetries are taken into consideration, the time required for the matrix iteration calculation rises only linearly with the ligand length n and is considerably less than that of the Monte Carlo method, which is used as a standard for comparison.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/bip.1981.360200808
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Kinetics of irreversible dissociation for proteins bound cooperatively to DNA (1984)
    New York : Wiley-Blackwell
    Biopolymers 23 (1984), S. 1249-1259 
    Details
    ISSN: 0006-3525
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: We consider the irreversible dissociation kinetics of proteins that bind cooperatively and nonspecifically to DNA. Our model consists of an infinitely long one-dimensional nucleic acid lattice on which are bound protein ligands. A set of adjacent bound proteins forms a cluster of length n. A protein molecule may dissociate from any site within the bound cluster, not only from the ends, as was assumed in a previous model of this process due to Lohman [(1983) Biopolymers 22, 1697-1713]. By considering this additional pathway, we present a more general treatment of the dissociation kinetics of cooperatively bound ligands. We show that dissociation from the (n-2) internal positions of an n-cluster is an important pathway when the initial fractional saturation of the lattice is close to unity and the co operatively is low. When the fractional saturation is initially equal to 1 and the co operatively is low, our model does not give the zero-order dissociation kinetics predicted by the Lohman model.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/bip.360230709
    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...