Results 261 to 270 of about 4,919,639 (299)

Hardware acceleration of simulated annealing for constraint satisfaction problems. [PDF]

Nat Commun
Pannone A, Nair RT, Krishnan P, Carletti F, Ravichandran H, Gundapuneni P, Dutta A, Ghosh S, Chen C, Redwing JM, Das S.   +10 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Combinatorial Problems

Canadian Journal of Mathematics, 1950
Let it be required to arrange v elements into v sets such that every set contains exactly k distinct elements and such that every pair of sets has exactly elements in common . This combinatorial problem is studied in conjunction with several similar problems, and these problems are proved impossible for an infinitude of v and k. An incidence matrix is
Chowla, Sarvadaman, Ryser, H. J.
openaire   +2 more sources

A combinatorial problem in pharmacology

Journal of Mathematical Biology, 1982
A novel coding scheme is used to enumerate configurations in a combinatorial problem arising in research on effects of drugs or radiation on DNA.
Weiss, George H., Rice, John
openaire   +3 more sources

On Certain Combinatorial Problems

American Journal of Physics, 1962
In a recent paper, McLachlan and Chamberlain have proposed and solved the following problem: To find the number W(n,m,M) of ways of distributing m indistinguishable objects into n boxes with no more than M in each box. We present in this paper two additional methods for solving this problem and give solutions to four problems proposed but not solved by
Rosenstock, H. B., Maradudin, A. A.
openaire   +1 more source

On A Combinatorial Problem III

Canadian Mathematical Bulletin, 1964
A family of sets {Aα} is said by Miller [3] to have property B if there exists a set S which meets all the sets Aα and contains none of them. Property B has been extensively studied in several recent papers (see the references in [2] and the last chapter of P. Erdös and A. Hajnal, On chromatic number of graphs and set systems, Acta. Math. Acad.
openaire   +2 more sources

On A Combinatorial Problem of Erdös

Canadian Mathematical Bulletin, 1969
A family of sets is said to possess property if there exists a set such that and for every We consider the following question raised by P. Erdös |1|: let n and N be positive integers, n ≥ 2 and N ≥ 2n - 1 and let S be a set of N elements; what is the least integer (provided such an integer exists), for which there exists a family of subsets of
Abbott, H. L., Hanson, D.
openaire   +2 more sources

Combinatorial Problems: Reductibility and Approximation

Operations Research, 1978
Recent research in the theory of algorithms has determined that many classical operations research problems are computationally related; i.e., an efficient algorithm for one implies the existence of efficient algorithms for everyone or a proof that one is inherently difficult implies they are all so. This paper presents a tutorial of this concept.
Sartaj Sahni, Ellis Horowitz
openaire   +2 more sources

Combinatorial Problems in Infinite Spaces

Designs, Codes and Cryptography, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

An Algebraic Model for Combinatorial Problems

SIAM Journal on Computing, 1996
Summary: A new algebraic model, called the generalized satisfiability problem (GSP) model, is introduced for representing and solving combinatorial problems. The GSP model is an alternative to the common method in the literature of representing such problems as language-recognition problems.
Richard Edwin Stearns, Harry B. Hunt III
openaire   +2 more sources