14161 search results - page 389 / 2833 » On generalized middle-level problem |
238
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
140
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— We address general filtering problems on the Euclidean group SE(3). We first generalize, to stochastic nonlinear systems evolving on SE(3), the particle filter of Li...
145
click to vote
LICS
2006
IEEE
16 years 23 days ago
2006
IEEE
In this paper, we consider the control of general hybrid systems. In this context we show that time-abstract bisimulation is not adequate for solving such a problem. That is why w...
185
click to vote
SPIRE
2005
Springer
16 years 7 days ago
2005
Springer
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...
147
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...