11740 search results - page 98 / 2348 » More Problems in Rewriting |
113
Voted
IJCAI
1989
15 years 1 months ago
1989
Existing explanation facilities are typically far more appropriate for knowledge engineers engaged in system maintenance than for endusers of the system. This is because the expla...
120
click to vote
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
124
click to vote
SIGIR
2012
ACM
13 years 3 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
74
Voted
NETWORKS
2007
15 years 6 days ago
2007
The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, 38 (2001), 194-198.]. However the statu...
95
Voted
DAM
2008
15 years 24 days ago
2008
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...