Sciweavers

11740 search results - page 80 / 2348
» More Problems in Rewriting
Sort
View
EVOW
2009
Springer
15 years 1 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
PODS
2004
ACM
120views Database» more  PODS 2004»
16 years 4 months ago
Locally Consistent Transformations and Query Answering in Data Exchange
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions ? ta...
Marcelo Arenas, Pablo Barceló, Ronald Fagin...
208
Voted
FASE
2004
Springer
15 years 7 months ago
Specification and Analysis of Real-Time Systems Using Real-Time Maude
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
Peter Csaba Ölveczky, José Meseguer
LRE
2006
175views more  LRE 2006»
15 years 4 months ago
Automatically generating related queries in Japanese
Web searchers reformulate their queries, as they adapt to search engine behavior, learn more about a topic, or simply correct typing errors. Automatic query rewriting can help user...
Rosie Jones, Kevin Bartz, Pero Subasic, Benjamin R...
CADE
2007
Springer
16 years 4 months ago
Predictive Labeling with Dependency Pairs Using SAT
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
Adam Koprowski, Aart Middeldorp