Sciweavers

505 search results - page 3 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Detection of Distributed Constraint Violations
In many distributed environments, the primary function of monitoring software is to detect anomalies, that is, instances when system behavior deviates substantially from the norm....
Shipra Agrawal, Supratim Deb, K. V. M. Naidu, Raje...
MOBIHOC
2007
ACM
14 years 8 months ago
Cross-layer latency minimization in wireless networks with SINR constraints
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
ICMCS
2005
IEEE
131views Multimedia» more  ICMCS 2005»
14 years 2 months ago
A Distributed Algorithm for Congestion-Minimized Multi-Path Routing Over Ad-Hoc Networks
When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield ...
Xiaoqing Zhu, Bernd Girod
DAC
1996
ACM
14 years 17 days ago
Delay Minimal Decomposition of Multiplexers in Technology Mapping
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step tha...
Shashidhar Thakur, D. F. Wong, Shankar Krishnamoor...
ATAL
2003
Springer
14 years 1 months ago
Minimizing communication cost in a distributed Bayesian network using a decentralized MDP
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
Jiaying Shen, Victor R. Lesser, Norman Carver