Results 211 to 220 of about 1,746,055 (248)
A novel pray optimization algorithm for six degree of freedom robotic arm trajectory planning. [PDF]
Sci RepAlabu-Husain AF +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Polynomial Time Algorithm for Lossy Population Recovery
IEEE Annual Symposium on Foundations of Computer Science, 2013We give a polynomial time algorithm for the lossy population recovery problem. In this problem, the goal is to approximately learn an unknown distribution on binary strings of length n from lossy samples: for some parameter μ each coordinate of the ...
Ankur Moitra, M. Saks
semanticscholar +3 more sources
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
SIAM Journal on Computing, 1987J. Horton
semanticscholar +3 more sources
A polynomial-time algorithm for the maximum clique problem
International Conference on Interaction Sciences, 2013Z. Akbari
semanticscholar +3 more sources
A Polynomial Time Algorithm for Fault Diagnosability
IEEE Annual Symposium on Foundations of Computer Science, 1984G. Sullivan
semanticscholar +3 more sources
SIAM Symposium on Simplicity in Algorithms, 2020
In a recent breakthrough work, Gartland and Lokshtanov [FOCS 2020] showed a quasi-polynomial-time algorithm for Maximum Weight Independent Set in $P_t$-free graphs, that is, graphs excluding a fixed path as an induced subgraph.
M. Pilipczuk +2 more
semanticscholar +1 more source
In a recent breakthrough work, Gartland and Lokshtanov [FOCS 2020] showed a quasi-polynomial-time algorithm for Maximum Weight Independent Set in $P_t$-free graphs, that is, graphs excluding a fixed path as an induced subgraph.
M. Pilipczuk +2 more
semanticscholar +1 more source
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
IEEE Annual Symposium on Foundations of Computer Science, 2023We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities.
Jan van den Brand +7 more
semanticscholar +1 more source
A polynomial-time algorithm for pliable index coding
International Symposium on Information Theory, 2016Pliable index coding considers a server with m messages and n clients where each client has as side information a subset of the messages. We seek to minimize the number of transmissions the server should make, so that each client receives (any) one ...
Linqi Song, C. Fragouli
semanticscholar +1 more source