4865 search results - page 745 / 973 » The Complexity of Graph Connectivity |
127
click to vote
COLING
1992
15 years 5 months ago
1992
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
142
click to vote
CIDR
2009
15 years 5 months ago
2009
Enterprise environments have isolated teams responsible separately for database management and the management of underlying networkattached server-storage infrastructure (referred...
131
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
170
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
164
click to vote
CGF
2008
15 years 4 months ago
2008
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...