Sciweavers

3220 search results - page 458 / 644
» Constrained Graph Processes
Sort
View
INFOCOM
2006
IEEE
16 years 13 days ago
To Peer or Not to Peer: Modeling the Evolution of the Internet's AS-Level Topology
— Internet connectivity at the AS level, defined in terms of pairwise logical peering relationships, is constantly evolving. This evolution is largely a response to economic, po...
Hyunseok Chang, Sugih Jamin, Walter Willinger
LICS
2005
IEEE
16 years 6 hour ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe
DAC
2009
ACM
15 years 11 months ago
A computing origami: folding streams in FPGAs
Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has a...
Andrei Hagiescu, Weng-Fai Wong, David F. Bacon, Ro...
SERP
2008
15 years 7 months ago
Mapping Data-Flow Dependencies onto Distributed Embedded Systems
Model-driven development (MDD) is an emerging paradigm and has become state-of-the-art for embedded systems software design. In the overall design process, several steps have to be...
Stefan Kugele, Wolfgang Haberl
USS
2004
15 years 7 months ago
Static Disassembly of Obfuscated Binaries
Disassembly is the process of recovering a symbolic representation of a program's machine code instructions from its binary representation. Recently, a number of techniques h...
Christopher Krügel, William K. Robertson, Fre...