Sciweavers

4345 search results - page 832 / 869
» Temporal Constraint Networks
Sort
View
LATIN
2010
Springer
13 years 6 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
MICS
2010
102views more  MICS 2010»
13 years 6 months ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
MIDDLEWARE
2010
Springer
13 years 6 months ago
Prometheus: User-Controlled P2P Social Data Management for Socially-Aware Applications
Recent Internet applications, such as online social networks and user-generated content sharing, produce an unprecedented amount of social information, which is further augmented b...
Nicolas Kourtellis, Joshua Finnis, Paul Anderson, ...
MP
2010
99views more  MP 2010»
13 years 6 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
SIAMCO
2010
147views more  SIAMCO 2010»
13 years 6 months ago
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...
Giacomo Como, Fabio Fagnani, Sandro Zampieri