Sciweavers

7092 search results - page 15 / 1419
» Parallelizing constraint programs
Sort
View
CAV
2009
Springer
134views Hardware» more  CAV 2009»
14 years 9 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
RTA
2000
Springer
14 years 17 days ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
IPPS
1999
IEEE
14 years 1 months ago
Evolution-Based Scheduling of Fault-Tolerant Programs on Multiple Processors
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
Piotr Jedrzejowicz, Ireneusz Czarnowski, Henryk Sz...
ISSS
1995
IEEE
96views Hardware» more  ISSS 1995»
14 years 16 days ago
Time-constrained code compaction for DSPs
{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...
Rainer Leupers, Peter Marwedel
TNN
2010
182views Management» more  TNN 2010»
13 years 3 months ago
A discrete-time neural network for optimization problems with hybrid constraints
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
Huajin Tang, Haizhou Li, Zhang Yi