92 search results - page 13 / 19 » Reducing BDD Size by Exploiting Structural Connectivity |
GIS
2003
ACM
14 years 8 months ago
2003
ACM
With the proliferation of mobile computing, the ability to index efficiently the movements of mobile objects becomes important. Objects are typically seen as moving in two-dimensi...
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
SOFTVIS
2010
ACM
13 years 7 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
PDPTA
2000
13 years 8 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
ICPP
2002
IEEE
14 years 13 days ago
2002
IEEE
This work considers switching fabrics with distributed packet routing to achieve high scalability and low costs. The considered switching fabrics are based on a multistage structu...