Sciweavers

2473 search results - page 489 / 495
» The Logic of Communication Graphs
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
ECAI
2004
Springer
14 years 27 days ago
Emergence of Complex Networks through Local Optimization
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
Josep M. Pujol, Andreas Flache, Ramon Sangües...
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 27 days ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
ASAP
2003
IEEE
133views Hardware» more  ASAP 2003»
14 years 24 days ago
Storage Management in Process Networks using the Lexicographically Maximal Preimage
At the Leiden Embedded Research Center, we are developing a compiler called Compaan that automatically translates signal processing applications written in Matlab into Kahn Proces...
Alexandru Turjan, Bart Kienhuis
P2P
2003
IEEE
110views Communications» more  P2P 2003»
14 years 23 days ago
The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems
In this paper, we take an availability-centric view on quality of service (QoS) and propose a model and mechanisms for studying the effectiveness of realistic replication schemes ...
Giwon On, Jens Schmitt, Ralf Steinmetz