3008 search results - page 325 / 602 » Independence in connected graphs |
172
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
We present a new algorithm that enables a convex shaped robot to explore an unknown planar workspace, i.e., an unknown configuration space diffeomorphic to SE(2). This new algor...
150
click to vote
IV
2002
IEEE
15 years 11 months ago
2002
IEEE
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...
182
Voted
SAC
2000
ACM
15 years 11 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
210
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
151
click to vote
ECOOP
2006
Springer
15 years 10 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...