Sciweavers

1983 search results - page 101 / 397
» Competitive graph searches
Sort
View
IANDC
2008
92views more  IANDC 2008»
13 years 8 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
CIKM
2009
Springer
14 years 2 months ago
Graph classification based on pattern co-occurrence
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
Ning Jin, Calvin Young, Wei Wang
IJCAI
2003
13 years 9 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus
PDP
2005
IEEE
14 years 1 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
WABI
2009
Springer
162views Bioinformatics» more  WABI 2009»
14 years 2 months ago
Aligning Biomolecular Networks Using Modular Graph Kernels
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
Fadi Towfic, M. Heather West Greenlee, Vasant Hona...