1529 search results - page 75 / 306 » Search Space Analysis of the Linear Ordering Problem |
138
Voted
SIGIR
2006
ACM
15 years 9 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
121
Voted
ENTCS
2008
15 years 3 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
173
click to vote
HIS
2009
15 years 1 months ago
2009
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In ...
163
Voted
DAGSTUHL
2007
15 years 5 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...
120
Voted
ICDAR
2009
IEEE
15 years 10 months ago
2009
IEEE
Table analysis is a complex problem, involving searching solutions from a large search space. Studies show that finding the most credible answers to complex problems often requir...