1404 search results - page 200 / 281 » On General Laws of Complex Networks |
130
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
138
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
120
click to vote
MLDM
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. This paper proposes a general local learning framework to effectively alleviate the complexities of classifier design by means of “divide and conquer” principle and ...
124
click to vote
IJCIM
2007
15 years 4 months ago
2007
: Software applications interoperability is a challenge for modern enterprises. It needs establishing standards and protocols for data exchange between different enterprise systems...
123
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...