Search results for "Computer Science::Data Structures and Algorithms"

showing 10 items of 96 documents

The Rural Postman Problem on mixed graphs with turn penalties

2002

In this paper we deal with a problem which generalizes the Rural Postman Problem defined on a mixed graph (MRPP). The generalization consists of associating a non-negative penalty to every turn as well as considering the existence of forbidden turns. This new problem fits real-world situations more closely than other simpler problems. A solution tour must traverse all the requiring service arcs and edges of the graph while not making forbidden turns. Its total cost will be the sum of the costs of the traversed arcs and edges together with the penalties associated with the turns done. The Mixed Rural Postman Problem with Turn Penalties (MRPPTP) consists of finding such a tour with a total mi…

Mathematical optimizationTraverseGeneral Computer SciencePolynomial transformationTotal costMixed graphManagement Science and Operations ResearchTravelling salesman problemModeling and SimulationComputer Science::Data Structures and AlgorithmsHeuristicsArc routingMetaheuristicMathematicsComputers & Operations Research
researchProduct

Mappings of finite distortion: The sharp modulus of continuity

2003

We establish an essentially sharp modulus of continuity for mappings of subexponentially integrable distortion.

Mathematics::ProbabilityIntegrable systemApplied MathematicsGeneral MathematicsDistortionMathematical analysisGeometryComputer Science::Computational ComplexityComputer Science::Data Structures and AlgorithmsModulus of continuityMathematicsTransactions of the American Mathematical Society
researchProduct

"Exclusion contour(exp.) 8 : Meff" of "Search for squarks and gluinos in final states with jets and missing transverse momentum using 36 fb$^{-1}$ of…

2018

Expected 95% CL exclusion contours from Meff-based searches on the squark mass and the mass gap ratio x in a SUSY scenario where squarks are produced in pairs and decay via an intermediate lightest chargino or second lightest neutralino to the lightest neutralino, $\tilde{q} \rightarrow q \tilde{\chi}_{1}^{\pm} \rightarrow q W^{\pm} \tilde{\chi}_{1}^{0}$, or $\tilde{q} \rightarrow q \tilde{\chi}_{2}^{0} \rightarrow qq Z/h \tilde{\chi}_{1}^{0}$.

P P --> SQUARK SQUARK X13000.0CLSHigh Energy Physics::PhenomenologyHigh Energy Physics::ExperimentComputer Science::Data Structures and Algorithms
researchProduct

"Exclusion contour(obs.) 8 : Meff" of "Search for squarks and gluinos in final states with jets and missing transverse momentum using 36 fb$^{-1}$ of…

2018

Observed 95% CL exclusion contours from Meff-based searches on the squark mass and the mass gap ratio x in a SUSY scenario where squarks are produced in pairs and decay via an intermediate lightest chargino or second lightest neutralino to the lightest neutralino, $\tilde{q} \rightarrow q \tilde{\chi}_{1}^{\pm} \rightarrow q W^{\pm} \tilde{\chi}_{1}^{0}$, or $\tilde{q} \rightarrow q \tilde{\chi}_{2}^{0} \rightarrow qq Z/h \tilde{\chi}_{1}^{0}$.

P P --> SQUARK SQUARK X13000.0CLSHigh Energy Physics::PhenomenologyHigh Energy Physics::ExperimentComputer Science::Data Structures and Algorithms
researchProduct

"X-section U.L. & best SR 8 : Meff" of "Search for squarks and gluinos in final states with jets and missing transverse momentum using 36 fb$^{-1…

2018

Observed 95% CL upper limit on the signal cross-section from Meff-based searches in a SUSY scenario where squarks are produced in pairs and decay via an intermediate lightest chargino or second lightest neutralino to the lightest neutralino, $\tilde{q} \rightarrow q \tilde{\chi}_{1}^{\pm} \rightarrow q W^{\pm} \tilde{\chi}_{1}^{0}$, or $\tilde{q} \rightarrow q \tilde{\chi}_{2}^{0} \rightarrow qq Z/h \tilde{\chi}_{1}^{0}$.

P P --> SQUARK SQUARK X13000.0High Energy Physics::PhenomenologyHigh Energy Physics::ExperimentComputer Science::Data Structures and AlgorithmsSIG
researchProduct

"Table 1" of "$\Lambda$ polarization in associated K$^+$ - $\Lambda$ electro-production"

2000

LAMBDA polarization, with respect to the p_gamma x p_k axis.

POLMathematics::CombinatoricsStrange productionElectron productionComputer Science::Discrete Mathematics2.91PolarizationE- P --> LAMBDA K+ E-ExclusiveComputer Science::Data Structures and Algorithms
researchProduct

Coherent quantum evolution via reservoir driven holonomies.

2006

We show that in the limit of a strongly interacting environment a system initially prepared in a decoherence-free subspace (DFS) coherently evolves in time, adiabatically following the changes of the DFS. If the reservoir cyclicly evolves in time, the DFS states acquire a holonomy.

PhysicsQuantum decoherenceHolonomyGeneral Physics and AstronomyComputer Science::Software EngineeringQuantum evolutionComputer Science::PerformanceQuantum mechanicsHolonomieLimit (mathematics)Decoherence-free subspace (DFS)Quantum evolutionComputer Science::Data Structures and AlgorithmsSubspace topologyPhysical review letters
researchProduct

"Table 17" of "Search for a Heavy Neutral Particle Decaying to $e\mu$, $e\tau$, or $\mu\tau$ in $pp$ Collisions at $\sqrt{s}=8$ TeV with the ATLAS De…

2015

Cut flow for signal $\tilde{\nu}_{\tau}$ and Z' at 1TeV mass point.

Physics::Fluid Dynamics8000.0NComputer Science::Data Structures and Algorithms
researchProduct

A Constructive Arboricity Approximation Scheme

2020

The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.

PseudoforestArboricityApproximation algorithm0102 computer and information sciences02 engineering and technology01 natural sciencesConstructiveCombinatoricsSet (abstract data type)Computer Science::Discrete Mathematics010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)Partition (number theory)020201 artificial intelligence & image processingMatroid partitioningComputer Science::Data Structures and AlgorithmsGeneralLiterature_REFERENCE(e.g.dictionariesencyclopediasglossaries)Computer Science::Distributed Parallel and Cluster ComputingMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

Analyticity of a restricted formality

2020

International audience; The Kontsevich formality can be viewed as a non-linear map ℱ from the L∞ algebra of poly-vector fields on ℝd to the space of poly-differential operators. The space of the half-homogenous poly-vector fields is a sub-L∞ algebra. We prove here that the restriction of ℱto this subspace is weakly analytic.

Pure mathematics010102 general mathematicsStatistical and Nonlinear PhysicsFormalityComputer Science::Computational Complexity16. Peace & justiceSpace (mathematics)01 natural sciences0103 physical sciences010307 mathematical physics0101 mathematicsAlgebra over a field[MATH]Mathematics [math]Computer Science::Data Structures and AlgorithmsMathematical PhysicsSubspace topologyMathematics
researchProduct