Results 51 to 60 of about 2,188,345 (345)
Maximizing the Average Environmental Benefit of a Fleet of Drones under a Periodic Schedule of Tasks
AlgorithmsUnmanned aerial vehicles (UAVs, drones) are not just a technological achievement based on modern ideas of artificial intelligence; they also provide a sustainable solution for green technologies in logistics, transport, and material handling.
Vladimir Kats, Eugene Levner
doaj +1 more source
Simultaneously dominating all spanning trees of a graph
Electronic Journal of Graph Theory and Applications, 2022 We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann +2 more
doaj +1 more source
A polynomial time circle packing algorithm
Discrete Mathematics, 1993 A map on a surface \(S\) is a pair \((G,S)\) with \(G\) a graph which is 2-cell embedded in \(S\). A circle packing is a set of geodesic circles, with disjoint interiors, in a Riemannian surface \(S'\) of constant curvature. Connecting the midpoints of the circles with the touching points (with other circles or the same circle), one gets a graph on \(S'
openaire +1 more source
A polynomial-time parsing algorithm for TT-MCTAG [PDF]
Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - ACL-IJCNLP '09, 2009 This paper investigates the class of Tree-Tuple MCTAG with Shared Nodes, TT-MCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language processing, in particular for dealing with discontinuities and word order variation in languages such as German.
KALLMEYER L, SATTA, GIORGIO
openaire +3 more sources
Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm [PDF]
Symposium on the Theory of Computing, 2010 Given a rank-1 bimatrix game (A,B), i.e., where rank(A+B)=1, we construct a suitable linear subspace of the rank-1 game space and show that this subspace is homeomorphic to its Nash equilibrium correspondence.
B. Adsul, J. Garg, R. Mehta, M. Sohoni
semanticscholar +1 more source
Advanced Engineering Materials, EarlyView.Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +1 more source
Polynomial Time Algorithm for Shortest Paths in Interval Temporal Graphs
AlgorithmsWe develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs). While a polynomial time algorithm for this problem is known for contact sequence temporal graphs (CSGs), no such ...
Anuj Jain, Sartaj Sahni
doaj +1 more source
Advanced Engineering Materials, EarlyView.We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
Impact of decreasing polynomial degree in time needed to factor a 100 digits integer by General Number field sieve algorithm [PDF]
Engineering and Technology Journal, 2012 Factoring is very important in the field of cryptography, specifically in the Rivest, Shamir, Adleman(RSA) public-key cryptosystem, one of the most prevalent methods for transmitting and receiving secret data which its security relies on the fact that ...
Jamal A. Othman
doaj +1 more source
A Simple Algorithm for Consistent Query Answering under Primary Keys [PDF]
Logical Methods in Computer ScienceWe consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e.
Diego Figueira +3 more
doaj +1 more source