Sciweavers

597 search results - page 6 / 120
» Homomorphisms of random paths
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 12 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
ICRA
2000
IEEE
86views Robotics» more  ICRA 2000»
15 years 4 months ago
Randomized Planning for Short Inspection Paths
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
Tim Danner, Lydia E. Kavraki
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 3 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
COMPSAC
2008
IEEE
15 years 6 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit
DAM
2008
74views more  DAM 2008»
14 years 12 months ago
A distributional study of the path edge-covering numbers for random trees
Abstract. We study for various tree families the distribution of the number of edgedisjoint paths required to cover the edges of a random tree of size n. For all tree families cons...
Alois Panholzer