Results 21 to 30 of about 184,610 (206)
Scheduling uncertain orders in the customer–subcontractor context [PDF]
, 2003 Within the customer–subcontractor negotiation process, the first problem of the subcontractor is to provide the customer with a reliable order lead-time although his workload is partially uncertain.
Geneste, Laurent +2 more
core +2 more sources
Quantum Optimization of Fully Connected Spin Glasses
Physical Review X, 2015 Many NP-hard problems can be seen as the task of finding a ground state of a disordered highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it is often necessary to represent those graphs in the annealer’s hardware ...
Davide Venturelli +5 more
doaj +1 more source
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases [PDF]
, 2012 Many studies have been conducted on seeking the efficient solution for subgraph similarity search over certain (deterministic) graphs due to its wide application in many fields, including bioinformatics, social network analysis, and Resource Description ...
Chen, Lei +3 more
core +3 more sources
The Robustness Analysis of Wireless Sensor Networks under Uncertain Interference
The Scientific World Journal, 2013 Based on the complex network theory, robustness analysis of condition monitoring wireless sensor network under uncertain interference is present. In the evolution of the topology of sensor networks, the density weighted algebraic connectivity is taken ...
Changjian Deng
doaj +1 more source
Energies, 2019 Electric vehicles (EVs) can be regarded as a kind of demand response (DR) resource. Nevertheless, the EVs travel behavior is flexible and random, in addition, their willingness to participate in the DR event is uncertain, they are expected to be managed ...
Lidan Chen +2 more
doaj +1 more source
Anonymizing Social Graphs via Uncertainty Semantics
, 2014 Rather than anonymizing social graphs by generalizing them to super nodes/edges or adding/removing nodes and edges to satisfy given privacy parameters, recent methods exploit the semantics of uncertain graphs to achieve privacy protection of ...
Imine, Abdessamad +2 more
core +2 more sources
Robust Densest Subgraph Discovery
, 2018 Dense subgraph discovery is an important primitive in graph mining, which has a wide variety of applications in diverse domains. In the densest subgraph problem, given an undirected graph $G=(V,E)$ with an edge-weight vector $w=(w_e)_{e\in E}$, we aim to
Miyauchi, Atsushi, Takeda, Akiko
core +1 more source
Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer
Molecular Oncology, EarlyView.COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann +61 more
wiley +1 more source
Mining Maximal Cliques from an Uncertain Graph [PDF]
, 2014 We consider mining dense substructures (maximal cliques) from an uncertain graph, which is a probability distribution on a set of deterministic graphs.
Mukherjee, Arko +3 more
core +3 more sources
Molecular Oncology, EarlyView.Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source