Sciweavers

2082 search results - page 42 / 417
» Change Paths in Reasoning!
Sort
View
ESIAT
2009
IEEE
13 years 5 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
ICMCS
2000
IEEE
89views Multimedia» more  ICMCS 2000»
14 years 1 days ago
A Knowledge Engineering Approach for Image Classification based on Probabilistic Reasoning Systems
We present a knowledge engineering approach for image classification that is based on probabilistic reasoning systems. The approach gives the knowledge engineer a systematic way ...
Seungyup Paek, Shih-Fu Chang
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 5 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
ICCAD
2008
IEEE
98views Hardware» more  ICCAD 2008»
14 years 4 months ago
Statistical path selection for at-speed test
Abstract— Process variations make at-speed testing significantly more difficult. They cause subtle delay changes that are distributed rather than the localized nature of a trad...
Vladimir Zolotov, Jinjun Xiong, Hanif Fatemi, Chan...
GIS
2010
ACM
13 years 6 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...