697 search results - page 65 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
CACM
2008
13 years 7 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
TKDE
2008
13 years 7 months ago
2008
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...