Sciweavers

11740 search results - page 35 / 2348
» More Problems in Rewriting
Sort
View
ACL
2011
13 years 11 days ago
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 9 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
DAGSTUHL
2006
13 years 10 months ago
Modeling and Simulating Biological Processes with Stochastic Multiset Rewriting
ed Abstract Membrane systems are models of computation inspired by the structure and the function of biological cells. The model was introduced in 1998 by Gh. Paun and since then m...
Matteo Cavaliere, Sean Sedwards
LFCS
2007
Springer
14 years 2 months ago
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
AAAI
2006
13 years 10 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons