Sciweavers

868 search results - page 125 / 174
» Finding Most Likely Solutions
Sort
View
AICCSA
2005
IEEE
113views Hardware» more  AICCSA 2005»
13 years 11 months ago
Towards autonomic Web services
Autonomic Computing was introduced to reduce the complexity of managing computing systems; however, the heterogeneous nature existing in most computing systems introduces some dif...
Amir Zeid, Sherif A. Gurguis
UAI
2004
13 years 10 months ago
Annealed MAP
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...
Changhe Yuan, Tsai-Ching Lu, Marek J. Druzdzel
AIPS
2000
13 years 10 months ago
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
Minh Binh Do, Biplav Srivastava, Subbarao Kambhamp...
EOR
2006
73views more  EOR 2006»
13 years 9 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
JCP
2008
131views more  JCP 2008»
13 years 9 months ago
Multi-Index Cooperative Mixed Strategy for Service Selection Problem in Service-Oriented Architecture
Under the environment of Service-Oriented Architecture (SOA), service users have to decide how to choose the proper provider from the candidates to obtain optimal service level. Th...
Yimin Shen, Jing Zhang, Yushun Fan