Sciweavers

202 search results - page 39 / 41
» Locally identifying coloring of graphs
Sort
View
MOBICOM
2010
ACM
14 years 9 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
AAAI
2006
14 years 11 months ago
Identification and Evaluation of Weak Community Structures in Networks
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
Jianhua Ruan, Weixiong Zhang
ATAL
2010
Springer
14 years 10 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
SIAMSC
2010
142views more  SIAMSC 2010»
14 years 4 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
SACMAT
2009
ACM
15 years 4 months ago
Analysis of virtual machine system policies
The recent emergence of mandatory access (MAC) enforcement for virtual machine monitors (VMMs) presents an opportunity to enforce a security goal over all its virtual machines (VM...
Sandra Rueda, Hayawardh Vijayakumar, Trent Jaeger