Sciweavers

532 search results - page 8 / 107
» Tree exploration with advice
Sort
View
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 13 days ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
AOSD
2008
ACM
13 years 9 months ago
Tool-supported refactoring of aspect-oriented programs
Aspect-oriented programming languages provide new composition mechanisms for improving the modularity of crosscutting concerns. Implementations of such language support use advanc...
Jan Wloka, Robert Hirschfeld, Joachim Hänsel
CLA
2007
13 years 9 months ago
Inducing Decision Trees via Concept Lattices
The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of cluster...
Radim Belohlávek, Bernard De Baets, Jan Out...
ETS
2002
IEEE
96views Hardware» more  ETS 2002»
13 years 7 months ago
The Wisconsin School of the Air: success story with implications
The rise of computer-based online learning represents either the most exciting and versatile educational technology ever or the first stage of an unrelenting boom and bust cycle (...
William Bianchi
GCB
2007
Springer
91views Biometrics» more  GCB 2007»
14 years 1 months ago
A Study on the Empirical Support for Prior Distributions on Phylogenetic Tree Topologies
: There are several models for the evolutionary process forming a species tree. We examine the Birth-and-Death model (BDM), the Proportional-to-Distinguishable Arrangements (PDA) m...
Lin Himmelmann, Dirk Metzler