Sciweavers

4095 search results - page 30 / 819
» How to test a tree
Sort
View
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 24 days ago
Simplifying XML schema: single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Fran...
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
13 years 8 months ago
How generative encodings fare on less regular problems
Generative representations allow the reuse of code and thus facilitate the evolution of repeated phenotypic themes or modules. It has been shown that generative representations pe...
Jeff Clune, Charles Ofria, Robert T. Pennock
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
14 years 1 months ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay
ICPR
2010
IEEE
13 years 11 months ago
How to Control Acceptance Threshold for Biometric Signatures with Different Confidence Values?
In the biometric verification, authentication is given when a distance of biometric signatures between enrollment and test phases is less than an acceptance threshold, and the perf...
Yasushi Makihara, Md. Altab Hossain, Yasushi Yagi
CPHYSICS
2004
85views more  CPHYSICS 2004»
13 years 7 months ago
Beyond benchmarking - how experiments and simulations can work together in plasma physics
There has been dramatic progress in the scope and power of plasma simulations in recent years; and because codes are generally cheaper to write, to run and to diagnose than experi...
Martin Greenwald