7421 search results - page 198 / 1485 » In search of dependable design |
171
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Due to the rapid growth in the size of the web, web search engines are facing enormous performance challenges. The larger engines in particular have to be able to process tens of ...
191
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Implicit user feedback, including click-through and subsequent browsing behavior, is crucial for evaluating and improving the quality of results returned by search engines. Severa...
190
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
212
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
196
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...