505 search results - page 86 / 101 » On A Graph Formalism for Ordered Edges |
192
Voted
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Widespread adoption of reconfigurable devices requires system level synthesis techniques to take an application written in a high level language and map it to the reconfigurable d...
146
Voted
ATVA
2009
Springer
16 years 22 days ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
161
Voted
JSSPP
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System S. Capable of processing enormous quantitie...
161
Voted
IAT
2008
IEEE
16 years 18 days ago
2008
IEEE
Communication networks, such as networks formed by phone calls and email communications, can be modeled as dynamic graphs with vertices representing agents and edges representing ...
146
Voted
OTM
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that rei...