Sciweavers

228 search results - page 13 / 46
» Two Normal Forms for Rewriting P Systems
Sort
View
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
12 years 10 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
TCS
2010
13 years 5 months ago
Left-forbidding cooperating distributed grammar systems
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...
Filip Goldefus, Tomás Masopust, Alexander M...
JOLLI
2010
106views more  JOLLI 2010»
13 years 5 months ago
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
Makoto Kanazawa
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
14 years 23 days ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai
RELMICS
2005
Springer
14 years 26 days ago
Relational Correspondences for Lattices with Operators
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
Jouni Järvinen, Ewa Orlowska