Sciweavers

688 search results - page 108 / 138
» Types for trees
Sort
View
CP
2007
Springer
15 years 6 months ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh
IWCLS
2007
Springer
15 years 6 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
ICDE
2006
IEEE
143views Database» more  ICDE 2006»
15 years 5 months ago
Application-aware Overlay Networks for Data Dissemination
XPORT (eXtensible Profile-driven Overlay Routing Trees) is a generic data dissemination system that supports an extensible set of data types and profiles, and an optimization fr...
Olga Papaemmanouil, Yanif Ahmad, Ugur Çetin...
MSWIM
2006
ACM
15 years 5 months ago
An efficient multicast packet delivery scheme for UMTS
In this paper we present an efficient scheme for the multicast transmission of the data in the Universal Mobile Telecommunications System (UMTS). We take advantage of the tree top...
Antonios G. Alexiou, Dimitrios Antonellis, Christo...
ICDAR
2005
IEEE
15 years 5 months ago
Fast Vector Matching Methods and Their Applications to Handwriting Recognition
A common practice in pattern recognition is to classify an unknown object by matching its feature vector with all the feature vectors stored in a database. When the number of clas...
Ying-Ho Liu, Wen-Hsiung Lin, Fu Chang, Chin-Chin L...