Results 41 to 50 of about 50,089 (313)

An Inventory Model under Space Constraint in Neutrosophic Environment: A Neutrosophic Geometric Programming Approach [PDF]

open access: yesNeutrosophic Sets and Systems, 2018
In this paper, an inventory model is developed without shortages where the production cost is inversely related to the set up cost and production quantity. In addition, the holding cost is considered time dependent.
Chaitali Kar   +2 more
doaj   +1 more source

23rd Workshop on (Constraint) Logic Programming 2009. Proceedings

open access: yes, 2022
The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases ...

core  

A study of encodings of constraint satisfaction problems with 0/1 variables [PDF]

open access: yes, 2003
Many constraint satisfaction problems (csp's) are formulated with 0/1 variables. Sometimes this is a natural encoding, sometimes it is as a result of a reformulation of the problem, other times 0/1 variables make up only a part of the problem. Frequently
Patrick Prosser   +3 more
core   +1 more source

Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment

open access: yesMolecular Oncology, EarlyView.
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

open access: yesMolecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson   +9 more
wiley   +1 more source

The Dungeon Variations Problem Using Constraint Programming [PDF]

open access: yes, 2021
The video games industry generates billions of dollars in sales every year. Video games can offer increasingly complex gaming experiences, with gigantic (but consistent) open worlds, thanks to larger and larger teams of developers and artists.
Yvon-Paliot, Sylvain   +3 more
core   +1 more source

Pre‐analytical optimization of cell‐free DNA and extracellular vesicle‐derived DNA for mutation detection in liquid biopsies

open access: yesMolecular Oncology, EarlyView.
Pre‐analytical handling critically determines liquid biopsy performance. This study defines practical best‐practice conditions for cell‐free DNA (cfDNA) and extracellular vesicle–derived DNA (evDNA), showing how processing time, storage conditions, tube type, and plasma input volume affect DNA integrity and mutation detection.
Jonas Dohmen   +11 more
wiley   +1 more source

Case Study: Constraint Programming in a System Level Synthesis Framework

open access: yes, 2014
This article presents a case study of using a constraint programming solver in a system level synthesis framework called SYLVA. The solver is used to find the repetition vector of a synchronous data flow graph and serving as the design space exploration ...
Li, Shuo,   +3 more
core   +1 more source

Hippo pathway at the crossroads of stemness and therapeutic resistance in breast cancer

open access: yesMolecular Oncology, EarlyView.
Dysregulation of the Hippo pathway drives nuclear accumulation of YAP/TAZ, activating stemness‐related transcriptional programs that sustain breast cancer stemness and fuel therapeutic resistance across subtypes, underscoring Hippo signaling as a targetable vulnerability. Figure created and edited with BioRender.com.
Giulia Schiavoni   +11 more
wiley   +1 more source

Basic Techniques for Creating an Efficient CSP Solver [PDF]

open access: yesScientific Annals of Computer Science, 2007
Many computationally difficult problems from areas like planning and scheduling are easily modelled as constraint satisfaction problems (CSP). In order to have an uniform practical approach of these, a new programming paradigm emerged in the form of ...
C. Frăsinaru
doaj  

Home - About - Disclaimer - Privacy