83 search results - page 6 / 17 » Solving Coverage Problems with Embedded Graph Grammars |
CEC
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
SPAA
2004
ACM
14 years 12 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
JGAA
2002
13 years 6 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...