Sciweavers

4759 search results - page 705 / 952
» Parallelizing the Phylogeny Problem
Sort
View
HYBRID
2000
Springer
15 years 10 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
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...
Joseph S. Miller
ASPDAC
1995
ACM
116views Hardware» more  ASPDAC 1995»
15 years 10 months ago
A datapath synthesis system for the reconfigurable datapath architecture
Abstract — A datapath synthesis system (DPSS) for the reconfigurable datapath architecture (rDPA) is presented. The DPSS allows automatic mapping of high level descriptions onto...
Reiner W. Hartenstein, Rainer Kress
ISSS
1995
IEEE
96views Hardware» more  ISSS 1995»
15 years 10 months 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
RTSS
1995
IEEE
15 years 10 months ago
Compositional and Symbolic Model-Checking of Real-Time Systems
E cient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. Howe...
Kim Guldstrand Larsen, Paul Pettersson, Wang Yi
AAAI
2007
15 years 8 months ago
Population-Based Simulated Annealing for Traveling Tournaments
This paper reconsiders the travelling tournament problem, a complex sport-scheduling application which has attracted significant interest recently. It proposes a population-based...
Pascal Van Hentenryck, Yannis Vergados