Sciweavers

3055 search results - page 274 / 611
» Randomized Search Trees
Sort
View
126
Voted
IJCAI
1989
15 years 4 months ago
The Reason for the Benefits of Minimax Search
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
Anton Scheucher, Hermann Kaindl
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
15 years 4 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
SIGCSE
2002
ACM
149views Education» more  SIGCSE 2002»
15 years 2 months ago
A comprehensive project for CS2: combining key data structures and algorithms into an integrated web browser and search engine
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
Tia Newhall, Lisa Meeden
137
Voted
KDD
2008
ACM
176views Data Mining» more  KDD 2008»
16 years 3 months ago
Context-aware query suggestion by mining click-through and session data
Query suggestion plays an important role in improving the usability of search engines. Although some recently proposed methods can make meaningful query suggestions by mining quer...
Huanhuan Cao, Daxin Jiang, Jian Pei, Qi He, Zhen L...
BMCBI
2006
85views more  BMCBI 2006»
15 years 3 months ago
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
Background: Understanding how amino acid substitutions affect protein functions is critical for the study of proteins and their implications in diseases. Although methods have bee...
Rui Jiang, Hua Yang, Fengzhu Sun, Ting Chen