4524 search results - page 57 / 905 » The Complexity of Global Constraints |
232
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
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....
88
Voted
IPL
2008
15 years 15 days ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
93
Voted
JC
2002
15 years 5 days ago
2002
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
106
click to vote
WWW
2009
ACM
16 years 1 months ago
2009
ACM
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
122
Voted
TSP
2010
14 years 7 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...