Results 1  10
of
1,163
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Combinatorial stochastic processes
"... This is a collection of expository articles about various topics at the interface between enumerative combinatorics and stochastic processes. These articles expand on a course of lectures given at the École d’Été de Probabilités de St. Flour in July 2002. The articles are called ’chapters ’ and numb ..."
Abstract

Cited by 219 (15 self)
 Add to MetaCart
this Chapter 0, there are 10 chapters, each divided into sections. Most sections conclude with some Exercises. Those for which I don’t know solutions are called Problems. Acknowledgments Much of the research reviewed here was done jointly with David Aldous. Much credit is due to him, especially for the big
A dynamic survey of graph labellings
 Electron. J. Combin., Dynamic Surveys(6):95pp
, 2001
"... A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s. In the intervening years dozens of graph labelings techniques have been studied in over 1000 papers. Finding out what has been done ..."
Abstract

Cited by 167 (0 self)
 Add to MetaCart
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s. In the intervening years dozens of graph labelings techniques have been studied in over 1000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey I have collected everything I could find on graph labeling. For the convenience of the reader the survey includes a detailed table of contents and index.
Wrappers For Performance Enhancement And Oblivious Decision Graphs
, 1995
"... In this doctoral dissertation, we study three basic problems in machine learning and two new hypothesis spaces with corresponding learning algorithms. The problems we investigate are: accuracy estimation, feature subset selection, and parameter tuning. The latter two problems are related and are stu ..."
Abstract

Cited by 122 (7 self)
 Add to MetaCart
In this doctoral dissertation, we study three basic problems in machine learning and two new hypothesis spaces with corresponding learning algorithms. The problems we investigate are: accuracy estimation, feature subset selection, and parameter tuning. The latter two problems are related
Combinatorial Commutative Algebra
, 2004
"... The last decade has seen a number of exciting developments at the intersection of commutative algebra with combinatorics. New methods have evolved out of an influx of ideas from such diverse areas as polyhedral geometry, theoretical physics, representation theory, homological algebra, symplectic geo ..."
Abstract

Cited by 125 (5 self)
 Add to MetaCart
The last decade has seen a number of exciting developments at the intersection of commutative algebra with combinatorics. New methods have evolved out of an influx of ideas from such diverse areas as polyhedral geometry, theoretical physics, representation theory, homological algebra, symplectic geometry, graph theory, integer programming, symbolic computation, and statistics. The purpose of this volume is to provide a selfcontained introduction to some of the resulting combinatorial techniques for dealing with polynomial rings, semigroup rings, and determinantal rings. Our exposition mainly concerns combinatorially defined ideals and their quotients, with a focus on numerical invariants and resolutions, especially under gradings more refined than the standard integer grading. This project started at the COCOA summer school in Torino, Italy, in June 1999. The eight lectures on monomial ideals given there by Bernd Sturmfels were later written up by Ezra Miller and David Perkinson and published in [MP01]. We felt it would be nice to add more material and
Gröbner geometry of Schubert polynomials
 Ann. Math
"... Schubert polynomials, which a priori represent cohomology classes of Schubert varieties in the flag manifold, also represent torusequivariant cohomology classes of certain determinantal loci in the vector space of n ×n complex matrices. Our central result is that the minors defining these “matrix S ..."
Abstract

Cited by 102 (15 self)
 Add to MetaCart
Schubert polynomials, which a priori represent cohomology classes of Schubert varieties in the flag manifold, also represent torusequivariant cohomology classes of certain determinantal loci in the vector space of n ×n complex matrices. Our central result is that the minors defining these “matrix Schubert varieties” are Gröbner bases for any antidiagonal term order. The Schubert polynomials are therefore positive sums of monomials, each monomial representing the torusequivariant cohomology class of a component (a schemetheoretically reduced coordinate subspace) in the limit of the resulting Gröbner degeneration. Interpreting the Hilbert series of the flat limit in equivariant Ktheory, another corollary of the proof is that Grothendieck polynomials represent the classes of Schubert varieties in Ktheory of the flag manifold. An inductive procedure for listing the limit coordinate subspaces is provided by the proof of the Gröbner basis property, bypassing what has come to be known as Kohnert’s conjecture [Mac91]. The coordinate subspaces, which are
An Introduction to Bioinformatics Algorithms
, 2004
"... In the early 1990s when one of us was teaching his first bioinformatics class, he was not sure that there would be enough students to teach. Although ..."
Abstract

Cited by 83 (1 self)
 Add to MetaCart
In the early 1990s when one of us was teaching his first bioinformatics class, he was not sure that there would be enough students to teach. Although
Facts and Fallacies of Software Engineering
, 2002
"... The practice of building software is a "new kid on the block" technology. Though it may not seem this way for those who have been in the field for most of their careers, in the overall scheme of professions, software builders are relative "newbies."
In the short history of the s ..."
Abstract

Cited by 78 (0 self)
 Add to MetaCart
of the software field, a lot of facts have been identified, and a lot of fallacies promulgated. Those facts and fallacies are what this book is about.
There's a problem with those facts—and, as you might imagine, those fallacies. Many of these fundamentally important facts are learned by a software engineer
The Selfish
"... of British parents, he was educated at Oxford and did his doctorate under the Nobelprize winning ethologist Niko Tinbergen. From 1967 to 1969 he was an Assistant Professor at the University of California at Berkeley, returning as University Lecturer and later Reader in Zoology at New College, Oxfo ..."
Abstract

Cited by 63 (0 self)
 Add to MetaCart
of British parents, he was educated at Oxford and did his doctorate under the Nobelprize winning ethologist Niko Tinbergen. From 1967 to 1969 he was an Assistant Professor at the University of California at Berkeley, returning as University Lecturer and later Reader in Zoology at New College, Oxford, before becoming the first holder of the Simonyi Chair in 1995. He is a fellow of New College. The Selfish Gene (1976; second edition 1989) catapulted Richard Dawkins to fame, and remains his most famous and widely read work. It was followed by a string of bestselling books: The
Results 1  10
of
1,163