Sciweavers

694 search results - page 138 / 139
» Open Graphs and Computational Reasoning
Sort
View
NLP
2000
15 years 4 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
AIPS
2007
15 years 3 months ago
Context-Aware Logistic Routing and Scheduling
In context-aware route planning, agents have to plan their route on a common infrastructure in such a way that plans made by other agents are not invalidated, and no conflicts ar...
Adriaan ter Mors, Jonne Zutt, Cees Witteveen
CIKM
2008
Springer
15 years 3 months ago
Using English information in non-English web search
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
Wei Gao, John Blitzer, Ming Zhou
IJCAI
1989
15 years 2 months ago
Stochastic Analysis of Qualitative Dynamics
We extend qualitative reasoning with estimations of the relative likelihoods of the pos sible qualitative behaviors . We estimate the likelihoods by viewing the dynamics o f a sys...
Jon Doyle, Elisha Sacks
115
Voted
JCB
2006
115views more  JCB 2006»
15 years 1 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger