6105 search results - page 1028 / 1221 » A Parallel Algorithm for Bound-Smoothing |
218
click to vote
HYBRID
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
163
Voted
ASPDAC
1995
ACM
15 years 10 months ago
1995
ACM
Abstract — A datapath synthesis system (DPSS) for the reconfigurable datapath architecture (rDPA) is presented. The DPSS allows automatic mapping of high level descriptions onto...
149
Voted
ISSS
1995
IEEE
15 years 10 months ago
1995
IEEE
{DSP algorithms in most cases are subject to hard real-time constraints. In case of programmable DSP processors, meeting those constraints must be ensured by appropriate code gener...
165
click to vote
BMVC
2002
15 years 8 months ago
2002
This paper presents new techniques for improving the structural quality of automatically acquired architectural 3D models. Common architectural features like parallelism and ortho...
157
Voted
AAAI
2008
15 years 8 months ago
2008
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...