219 search results - page 24 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
108
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
119
click to vote
CRYPTO
2012
Springer
13 years 3 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
131
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
124
click to vote
AUTOMATICA
2005
15 years 1 months ago
2005
In this paper we present a new method of interval fuzzy model identification. The method combines a fuzzy identification methodology with some ideas from linear programming theory...
118
click to vote
JGAA
2006
15 years 1 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...