Sciweavers

2186 search results - page 243 / 438
» Considering an Organization's Memory
Sort
View
IFIP
2009
Springer
15 years 11 months ago
Secure Information Flow for Distributed Systems
We present an abstract language for distributed systems of processes with local memory and private communication channels. Communication between processes is done via messaging. Th...
Rafael Alpízar, Geoffrey Smith
FPL
2001
Springer
123views Hardware» more  FPL 2001»
15 years 11 months ago
Compilation Increasing the Scheduling Scope for Multi-memory-FPGA-Based Custom Computing Machines
This paper presents new achievements on the automatic mapping of algorithms, written in imperative software programming languages, to custom computing machines. The reconfigurable ...
João M. P. Cardoso, Horácio C. Neto
VLSID
2000
IEEE
75views VLSI» more  VLSID 2000»
15 years 11 months ago
Timing Analysis with Implicitly Specified False Paths
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
Eugene Goldberg, Alexander Saldanha
DIALM
1999
ACM
98views Algorithms» more  DIALM 1999»
15 years 11 months ago
Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...
SSD
1999
Springer
99views Database» more  SSD 1999»
15 years 10 months ago
Algorithms for Joining R-Trees and Linear Region Quadtrees
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are ...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...