2520 search results - page 225 / 504 » The complexity of approximating entropy |
169
click to vote
CIA
2006
Springer
15 years 10 months ago
2006
Springer
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...
127
click to vote
NIPS
2003
15 years 8 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
195
click to vote
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
172
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
350
click to vote
IWSOS
2011
Springer
14 years 9 months ago
2011
Springer
Abstract This paper depicts and evaluates an evolutionary design process for generating a complex self-organizing multicellular system based on Cellular Automata (CA). We extend th...