Sciweavers

914 search results - page 67 / 183
» Branch and Bound on the Network Model
Sort
View
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
15 years 4 months ago
Robust synchronization in networks of cyclic feedback systems
Abstract— This paper presents a result on the robust synchronization of outputs of statically interconnected non-identical cyclic feedback systems that are used to model, among o...
Abdullah Omar Hamadeh, Guy-Bart Stan, Jorge M. Gon...
DSN
2009
IEEE
15 years 4 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni
TCS
1998
14 years 9 months ago
ERCW PRAMs and Optical Communication
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
Philip D. MacKenzie, Vijaya Ramachandran
COMGEO
2008
ACM
14 years 9 months ago
Constructing minimum-interference networks
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 8 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...