737 search results - page 74 / 148 » State-dependent representation independence |
SMA
2005
ACM
14 years 2 months ago
2005
ACM
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...
CSCLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
This paper proposes a statistical mechanism to analyze the detector coverage in a negative selection algorithm, namely a quantitative measurement of a detector set’s capability ...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give â...
ASIAN
2004
Springer
14 years 2 months ago
2004
Springer
Designing custom solutions has been central to meeting a range of stringent and specialized needs of embedded computing, along such dimensions as physical size, power consumption, ...