Sciweavers

2314 search results - page 228 / 463
» Minimal Partitions of a Graph
Sort
View
KR
1994
Springer
15 years 8 months ago
Risk-Sensitive Planning with Probabilistic Decision Graphs
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
Sven Koenig, Reid G. Simmons
127
Voted
COR
2007
99views more  COR 2007»
15 years 4 months ago
An improved algorithm for the p-center problem on interval graphs with unit lengths
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
T. C. Edwin Cheng, Liying Kang, C. T. Ng
JIB
2006
102views more  JIB 2006»
15 years 4 months ago
3D image and graph based Computation of Protein Surface
The accessible surface of a macromolecule is a significant determinant of its action. The interaction between biomolecules or protein-ligand is dependent on their surfaces rather ...
A. Ranganath, K. C. Shet, N. Vidyavathi
CPC
2002
113views more  CPC 2002»
15 years 4 months ago
Some Inequalities For The Largest Eigenvalue Of A Graph
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
Vladimir Nikiforov
JAIR
2011
84views more  JAIR 2011»
14 years 11 months ago
Evaluating Temporal Graphs Built from Texts via Transitive Reduction
Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a t...
Xavier Tannier, Philippe Muller