Sciweavers

5015 search results - page 299 / 1003
» Model Checking a Path
Sort
View
ESIAT
2009
IEEE
15 years 4 months ago
Path Planning Based on Dynamic Sub-population Pseudo-Parallel Genetic Algorithm
Through analysis of present pseudo-parallel genetic algorithm, propose a new dynamic sub-population pseudo-parallel genetic algorithm. It changes the condition that the magnitude o...
Lei Li, Yuemei Ren, Changyu Yang
ICDCSW
2006
IEEE
16 years 17 days ago
A directional gossip protocol for path discovery in MANETs
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with th...
Roberto Beraldi
CVPR
1998
IEEE
15 years 10 months ago
Curves Matching Using Geodesic Paths
We present a method for matching curves which accommodates large and small deformation. The method preserves geometric similarities in the case of small deformation, and loosens t...
Isaac Cohen, Isabelle Herlin
ICMCS
1994
IEEE
110views Multimedia» more  ICMCS 1994»
15 years 10 months ago
Improving Continuous-Media Playback Performance with In-Kernel Data Paths
Continuous media playback suffers when a station's operating system offers insufficient 1/0 throughput. Conventional 1/0 system structures support a memory-oriented read and ...
Kevin R. Fall, Joseph Pasquale
COMPGEOM
2005
ACM
15 years 8 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer