نتایج جستجو برای: poa bulbosa

تعداد نتایج: 1912  

Journal: :Computational & Mathematical Organization Theory 2010
Balázs Kovács Glenn R. Carroll

In some organizational applications, the principle of allocation (PoA) and scale advantage (SA) oppose each other. While PoA implies that organizations with wide niches get punished, SA holds that large organizations gain an advantage because of scale efficiencies. The opposition occurs because many large organizations also possess wide niches. However, analyzing these theoretical mechanisms im...

2005
Alexis C. Kaporis Lefteris M. Kirousis Efpraxia I. Politopoulou Paul G. Spirakis

In large scale networks users often behave selfishly trying to minimize their routing cost. Modelling this as a noncooperative game, may yield a Nash equilibrium with unboundedly poor network performance. To measure this inefficacy, the Coordination Ratio or Price of Anarchy (PoA) was introduced. It equals the ratio of the cost induced by the worst Nash equilibrium, to the corresponding one ind...

Journal: :Automatica 2008
Takeshi Hatanaka Kiyotsugu Takaba

This paper considers uncertain constrained systems, and develops two algorighms for computing a probabilistic output admissible (POA) set which is a set of initial states probabilistically assured to satisfy the constraint. The first algorithm is inspired by an existing randomized sequential technique. The second algorithm alleviates the computational effort based on heuristics. The present alg...

Journal: :IEICE Transactions 2013
Soohong Daniel Park Jun Lee Choong Seon Hong

This letter proposes a new mechanism for network configuration on a mobile device that provides Point of Attachment (PoA) specific information using IEEE 802.21 and DHCP before moving to a new PoA. This allows the mobile device to prepare for intelligent handover decision either stateless address configuration or stateful address configuration when entering an IPv6 network. It allows the mobile...

2003
D. STOTT CHRISTOPHER J. LEE

Partial Order Alignment (POA) has been proposed recently as an alternative to conventional sequence alignment. Instead of the familiar tabular alignments, POA methods produce a partial order — a labeled directed acyclic graph — that includes the input sequences. In this paper, we formalize POA in terms of graphs, and show it corresponds to finding a Minimal Common Supergraph for a set of partia...

Journal: :The Journal of neuroscience : the official journal of the Society for Neuroscience 2011
Diego Gelman Amélie Griveau Nathalie Dehorter Anne Teissier Carolina Varela Ramón Pla Alessandra Pierani Oscar Marín

GABA-containing (GABAergic) interneurons comprise a very heterogeneous group of cells that are crucial for cortical function. Different classes of interneurons specialize in targeting specific subcellular domains of excitatory pyramidal cells or other interneurons, which provides cortical circuits with an enormous capability for information processing. As in other regions of the CNS, cortical i...

Journal: :Brain research 2003
J S Lonstein J M Dominguez S K Putnam G J De Vries E M Hull

In many mammals, hormonal fluctuations during pregnancy and parturition produce neurochemical events that are necessary for the transition from a non-maternal state to a maternal state that occurs when infants are born. However, the nature of these events is mostly unknown. We investigated whether changes in dopamine (DA) and serotonin (5-HT) activity within the preoptic area (POA) and striatum...

Journal: :CoRR 2014
Xilun Chen Chenxia Wu

There have been great efforts in studying the cascading behavior in social networks such as the innovation diffusion, etc. Game theoretically, in a social network where individuals choose from two strategies: A (the innovation) and B (the status quo) and get payoff from their neighbors for coordination, it has long been known that the Price of Anarchy (PoA) of this game is not 1, since the Nash...

Journal: :Theor. Comput. Sci. 2009
Leah Epstein Elena Kleiman Rob van Stee

We consider a scheduling problem on m machines, where each job is controlled by a selfish agent. Each agent is only interested in minimizing its own cost, defined as the total load of the machine that its job is assigned to. We consider the objective of maximizing the minimum load (the value of the cover) over the machines. Unlike the regular makespan minimization problem, which was extensively...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید