Sciweavers

12950 search results - page 2426 / 2590
» On Optimal Timed Strategies
Sort
View
CASES
2001
ACM
14 years 24 days ago
Storage allocation for embedded processors
In an embedded system, it is common to have several memory areas with different properties, such as access time and size. An access to a specific memory area is usually restricted...
Jan Sjödin, Carl von Platen
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
14 years 23 days ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
FPGA
2000
ACM
177views FPGA» more  FPGA 2000»
14 years 23 days ago
Automatic generation of FPGA routing architectures from high-level descriptions
In this paper we present a "high-level" FPGA architecture description language which lets FPGA architects succinctly and quickly describe an FPGA routing architecture. W...
Vaughn Betz, Jonathan Rose
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
14 years 21 days ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
VLDB
1995
ACM
97views Database» more  VLDB 1995»
14 years 21 days ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
« Prev « First page 2426 / 2590 Last » Next »