Sciweavers

2492 search results - page 276 / 499
» On the General Signature Trees
Sort
View
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
15 years 6 months ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner
JAL
2002
86views more  JAL 2002»
15 years 5 months ago
Exploiting structure in quantified formulas
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
Richard Edwin Stearns, Harry B. Hunt III
TSMC
2002
125views more  TSMC 2002»
15 years 5 months ago
Dynamic page based crossover in linear genetic programming
Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructi...
Malcolm I. Heywood, A. Nur Zincir-Heywood
MLQ
2010
124views more  MLQ 2010»
15 years 4 months ago
Countably categorical coloured linear orders
Abstract. In this paper, we give a classification of (finite or countable) ℵ0categorical coloured linear orders, generalizing Rosenstein’s characterization of ℵ0-categorica...
Feresiano Mwesigye, John K. Truss
ACL
2010
15 years 4 months ago
The Importance of Rule Restrictions in CCG
Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic v...
Marco Kuhlmann, Alexander Koller, Giorgio Satta