We study several coloring problems for geometric range-spaces. In addition to their theoretical interest, some of these problems arise in sensor networks. Given a set of points in R or R, we want to color them such that every region of a certain family (e.g., every disk containing at least a certain number of points) contains points of many (say, k) different colors. In this paper, we think of ...

The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Evolution (DE). Geometric Particle Swarm Optimization (GPSO) and Geometric Differential Evolution (GDE) are recently introduced formal generalization of traditional PSO and DE that apply naturally to both continuous and...

in this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. thena relation between totally fuzzy bounded sets and n-compactness is discussed.finally, a geometric characterization for fuzzy totally bounded sets in i- topologicalvector spaces is derived.