Sciweavers

548 search results - page 7 / 110
» Global value numbering using random interpretation
Sort
View
DLS
2008
264views Languages» more  DLS 2008»
14 years 10 months ago
Contextual values
Context-oriented programming proposes to treat execution context explicitly and to provide means for context-dependent adaptation at runtime. There are many mechanisms that can be...
Éric Tanter
NN
1998
Springer
14 years 9 months ago
Statistical estimation of the number of hidden units for feedforward neural networks
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
Osamu Fujita
AMC
2008
88views more  AMC 2008»
14 years 9 months ago
Stopping rules for box-constrained stochastic global optimization
We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second i...
Isaac E. Lagaris, Ioannis G. Tsoulos
CONSTRAINTS
2002
129views more  CONSTRAINTS 2002»
14 years 9 months ago
Cost-Based Arc Consistency for Global Cardinality Constraints
A global cardinality constraint (gcc) is specified in terms of a set of variables X = {x1, ..., xp} which take their values in a subset of V = {v1, ..., vd}. It constrains the numb...
Jean-Charles Régin
IJBC
2007
80views more  IJBC 2007»
14 years 9 months ago
Exact Approximations of omega Numbers
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
Cristian S. Calude, Michael J. Dinneen