Sciweavers

2356 search results - page 14 / 472
» Characterizations of postman sets
Sort
View
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
15 years 3 months ago
Characterizing a Tunably Difficult Problem in Genetic Programming
This paper examines the behavioral phenomena that occur with the tuning of the binomial-3 problem. Our analysis identifies a distinct set of phenomena that may be generalizable to...
Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo...
GD
2009
Springer
15 years 4 months ago
On the Characterization of Level Planar Trees by Minimal Patterns
We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns....
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
HYBRID
2000
Springer
15 years 3 months ago
Optimization-Based Verification and Stability Characterization of Piecewise Affine and Hybrid Systems
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
Alberto Bemporad, Fabio Danilo Torrisi, Manfred Mo...
SIGMOD
2005
ACM
114views Database» more  SIGMOD 2005»
15 years 12 months ago
Semantic characterizations of navigational XPath
We give semantic characterizations of the expressive power of navigational XPath (also called Core XPath) in terms of first order logic. XPath can be used to specify sets of nodes...
Maarten Marx, Maarten de Rijke
CSJM
2008
112views more  CSJM 2008»
14 years 12 months ago
About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
Artiom Alhazov, Yurii Rogozhin