Sciweavers

51 search results - page 2 / 11
» Boosting Search with Variable Elimination
Sort
View
GIS
2010
ACM
13 years 3 months ago
Location disambiguation in local searches using gradient boosted decision trees
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...
Ritesh Agrawal, James G. Shanahan
AI
1999
Springer
13 years 5 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
DATE
2002
IEEE
123views Hardware» more  DATE 2002»
13 years 10 months ago
False Path Elimination in Quasi-Static Scheduling
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...
G. Arrigoni, L. Duchini, Claudio Passerone, Lucian...
CIKM
2009
Springer
13 years 12 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
VMCAI
2005
Springer
13 years 10 months ago
Minimizing Counterexample with Unit Core Extraction and Incremental SAT
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
ShengYu Shen, Ying Qin, Sikun Li