Sciweavers

1983 search results - page 223 / 397
» Competitive graph searches
Sort
View
AISS
2010
118views more  AISS 2010»
13 years 5 months ago
A New Method for Service Binding in Service Oriented Architecture Using Auction Algorithm
One of the important debates in service-oriented architecture is the competitive conditions in the side of service provider and service consumer. In service-oriented architecture ...
Sahar Sohangir, Mir Ali Seyyedi
AAAI
2011
12 years 8 months ago
Exploiting Problem Symmetries in State-Based Planners
Previous research in Artificial Intelligence has identified the possibility of simplifying planning problems via the identification and exploitation of symmetries. We advance t...
Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein
JAIR
2008
103views more  JAIR 2008»
13 years 8 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
BMCBI
2007
146views more  BMCBI 2007»
13 years 8 months ago
PubMed related articles: a probabilistic topic-based model for content similarity
Background: We present a probabilistic topic-based model for content similarity called pmra that underlies the related article search feature in PubMed. Whether or not a document ...
Jimmy J. Lin, W. John Wilbur
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 8 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...