5316 search results - page 143 / 1064 » Which Search Problems Are Random |
125
Voted
WECWIS
2009
IEEE
15 years 10 months ago
2009
IEEE
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...
142
Voted
SODA
2000
ACM
15 years 4 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
120
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
112
Voted
ITNG
2006
IEEE
15 years 9 months ago
2006
IEEE
Purpose – This paper reports the findings of a major study examining the overlap among results retrieved by three major web search engines. The goal of the research was to: mea...
160
Voted
TSMC
2010
14 years 10 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...