In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.

0

0

Modeling human behavior is a complex task, as it might include unpredictability, sub-conscious knowledge and intuition. This paper presents some initial results from a novel algorithm that creates human behavior models automatically by observing humans performing. Furthermore, the paper uses conclusions from the No Free Lunch Theorems to signify the scalability of the modeling algorithm. These ...

After deriving the particle swarm equations from basic physics, this paper shows by contradiction that NFL Theorem 1, and consequently Theorems 2 and 3, are irrelevant to continuous optimization. As the discrete nature of matter at its most fundamental level is generally irrelevant from the broader classical perspective, so to is the discrete nature of an optimization problem at its most fundam...

In this study, we present a new scalable scheme for adapting the transmission rate of multimedia applications to the congestion level of the network. The scheme is based on the end-to-end Real Time transport protocol (RTP). Results achieved through simulations and measurements suggest the efficiency of the scheme in utilizing the network resources and decreasing the loss rates. However, with no...

Recently several classical Genetic Algorithm principles have been challenged-including the Fundamental Theorem of Genetic Algorithms and the Principle of Minimal Alphabets. In addition, the recent No Free Lunch theorems raise further concerns. In this paper we review these issues and offer some new directions for GA researchers.