Sciweavers

990 search results - page 125 / 198
» Sub-Graphs of Complete Graph
Sort
View
PPAM
2007
Springer
14 years 1 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
14 years 1 months ago
Multiresolution Approach for Motion Planning under Differential Constraints
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
Stephen R. Lindemann, Steven M. LaValle
GECCO
2003
Springer
14 years 27 days ago
Problem-Independent Schema Synthesis for Genetic Algorithms
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
Yong-Hyuk Kim, Yung-Keun Kwon, Byung Ro Moon
IFIP
1992
Springer
13 years 11 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski
ACSD
2007
IEEE
109views Hardware» more  ACSD 2007»
13 years 11 months ago
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
Victor Khomenko