10 research outputs found
Edge- and Node-Disjoint Paths in P Systems
Full text linkIn this paper, we continue our development of algorithms used for topological
network discovery. We present native P system versions of two fundamental
problems in graph theory: finding the maximum number of edge- and node-disjoint
paths between a source node and target node. We start from the standard
depth-first-search maximum flow algorithms, but our approach is totally
distributed, when initially no structural information is available and each P
system cell has to even learn its immediate neighbors. For the node-disjoint
version, our P system rules are designed to enforce node weight capacities (of
one), in addition to edge capacities (of one), which are not readily available
in the standard network flow algorithms.Comment: In Proceedings MeCBIC 2010, arXiv:1011.005
Effects of Number of Reinforcements and Interference on Visual and Olfactory Learning Modalities of the Honey Bee (Hymenoptera: Apidae)
Full text linkRandom Partial Reinforcement in the Honeybee: Effect on Asymptotic Performance and Resistance to Extinction
Full text linkEffects of Partial Reinforcement on Recruiting Behaviour in Honeybees Foraging Near the Hive
Full text linkReducing the Pollution Potential of Pesticides and Fertilizers in the Environmental Horticulture Industry: II. Lawn Care and Landscape Management
No full text
A novel bio-engineering approach to generate an eminent surface-functionalized template for selective detection of female sex pheromone of Helicoverpa armigera
No full textAbstracts, Forty-Seventh Annual Meeting, Eastern Branch Entomological Society of America
No full textVolume: 83Start Page: 241End Page: 28
