Sciweavers

1798 search results - page 176 / 360
» A Tree for All Seasons
Sort
View
JOT
2006
119views more  JOT 2006»
13 years 9 months ago
An efficient multiversion access control in a Temporal Object Oriented Database
Many data base applications require the storage and manipulation of different versions of data objects. To satisfy the diverse needs of these applications, current database system...
Gurusamy Arumugam, Muthuraman Thangaraj
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
13 years 9 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
CPC
1998
154views more  CPC 1998»
13 years 8 months ago
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
Brendan D. McKay, Robert W. Robinson
TSMC
2002
125views more  TSMC 2002»
13 years 8 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
ACL
2010
13 years 7 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