نتایج جستجو برای: level models are often np

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

2015
EK Boateng A Novejarque T Pheby ASC Rice W Huang

BACKGROUND Heterogeneity is increasingly recognized in clinical presentation of neuropathic pain (NP), but less often recognized in animal models. Neurochemical dysregulation in rodent dorsal root ganglia (DRG) is associated with peripheral nerve trauma, but poorly studied in non-traumatic NP conditions. METHODS This study aimed to investigate the temporal expressions of activating transcript...

This paper, considers the supplier selection in three echelon supply chain with Vendor Managed Inventory (VMI) strategy under price dependent demand condition. As there is a lack of study on the supplier selection in VMI literature, this paper presents a VMI model in supply chain including multi supplier, one distributer and multi retailer that distributer selects suppliers. Two class models (t...

Imen Hamdi Saïd Toumi

In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...

2014
Matthias Mittner Jörg Behrendt Uwe Menge Cora Titz Marcus Hasselhorn

Reaction times to previously ignored information are often delayed, a phenomenon referred to as negative priming (NP). Rothermund et al. (2005) proposed that NP is caused by the retrieval of incidental stimulus-response associations when consecutive displays share visual features but require different responses. In two experiments we examined whether the features (color, shape) that reappear in...

2004
Thomas Eiter Axel Polleres

Reasoning (LPNMR-7), I. Niemelä and V. Lifschitz, editors, LNCS, c 2004 Springer. Towards Automated Integration of Guess and Check Programs in Answer Set Programming ? Thomas Eiter1 and Axel Polleres2 1 Institut für Informationssysteme, TU Wien, A-1040 Wien, Austria [email protected] 2 Institut für Informatik, Universität Innsbruck, A-6020 Innsbruck, Austria [email protected] Abstrac...

Journal: :CoRR 2012
Greg Aloupis Erik D. Demaine Alan Guo

We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokémon. Our results apply to Super Mario Bros. 1, 3, Lost Levels, and Super Mario World; Donkey Kong Country 1–3; all Legend of Zelda games except Zelda II: The Adventure of Link; all Metroid games; and all Pokémon role-playing games. For Mario and Donkey Kong, w...

Journal: :European cells & materials 2015
J Mochida D Sakai Y Nakamura T Watanabe Y Yamamoto S Kato

Degeneration of the lumbar intervertebral discs is irreversible, with no treatment currently available. Building upon experimental studies that demonstrated the importance of the nucleus pulposus (NP) in preserving disc structure, we demonstrated that reinsertion of NP cells slowed further disc degeneration and that direct cell-to-cell contact co-culture with mesenchymal stromal cells (MSCs) si...

2002
Erich Friedman

We will show that the question of whether or not a given Spiral Galaxies puzzle has a solution is NP-complete. To do so, we construct Spiral Galaxies puzzles which correspond to arbitrary Boolean circuits. A circuit will be satisfied, (that is, have a set of inputs which give the desired outputs) if and only if the corresponding puzzle has a solution. Since Satisfiability is the canonical NP-co...

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

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