Sciweavers

6142 search results - page 25 / 1229
» The Complexity of Partition Functions
Sort
View
ALGOSENSORS
2006
Springer
15 years 1 months ago
A Flexible Algorithm for Sensor Network Partitioning and Self-partitioning Problems
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...
Sandip Roy, Yan Wan, Ali Saberi
JUCS
2007
84views more  JUCS 2007»
14 years 9 months ago
Deriving Consensus for Hierarchical Incomplete Ordered Partitions and Coverings
: A method for determining consensus of hierarchical incomplete ordered partitions and coverings of sets is presented in this chapter. Incomplete ordered partitions and coverings a...
Marcin Hernes, Ngoc Thanh Nguyen
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 3 months ago
Simultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
Chatchawit Aporntewan, Prabhas Chongstitvatana
NIPS
1996
14 years 11 months ago
Radial Basis Function Networks and Complexity Regularization in Function Learning
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
Adam Krzyzak, Tamás Linder