「Combinatorial」の共起表現一覧(1語右で並び替え)
該当件数 : 122件
en graph characterizations are utilized in | combinatorial algorithms, often for identifying a struct |
Research in | combinatorial algorithms, distributive programming, expe |
the subject of computational geometry and | combinatorial algorithms; she is known for her work with |
agrams were an important tool for studying | combinatorial and topological properties of polytopes. |
ng work on permutation statistics, and his | combinatorial approach to special functions, are especia |
h J. W. Cannon and W. R. Parry exploring a | combinatorial approach to the Cannon conjecture which re |
nder Razborov proved that a large class of | combinatorial arguments, dubbed natural proofs were unli |
Combinatorial biology allows the generation and selectio | |
In biotechnology, | combinatorial biology is the creation of a large number |
It is an attractive target for | combinatorial biosynthesis for many reasons: second gene |
n targeted for its potential to be used in | combinatorial chemical analysis. |
ity developed the first method for encoded | combinatorial chemical synthesis, a method for building |
The Journal of | Combinatorial Chemistry (usually abbreviated as J. Comb. |
Journal of | Combinatorial Chemistry publishes Articles, Reviews, Per |
s NASDAQ: SMMX is a pioneer in the area of | combinatorial chemistry applied to heterogeneous catalys |
The advent of | combinatorial chemistry has enabled medicinal chemists t |
Similar to | combinatorial chemistry, compounds are produced by biosy |
ends on competence in fields as diverse as | combinatorial chemistry, computer integrated manufacturi |
ivities such as high-throughput screening, | combinatorial chemistry, automated clinical and analytic |
se the visibility and the influence of the | combinatorial community. |
In mathematics, specifically in | combinatorial commutative algebra, a convex lattice poly |
minimization, computational geometry, and | combinatorial counting. |
"The Crust and the β-Skeleton: | Combinatorial Curve Reconstruction". |
alysis of variance and in related areas of | combinatorial design, especially in association schemes. |
f three editors-in-chief of the Journal of | Combinatorial Designs since 1992. |
blems of the design of experiments involve | combinatorial designs, as in this example. |
- A software package for graphs, digraphs, | combinatorial designs, projective configurations, polyhe |
whose research concerns graph algorithms, | combinatorial designs, and their applications. |
those aspects of the subject that involve | combinatorial designs. |
edding algorithms, graphs on surfaces, and | combinatorial designs. |
ses and the search space suffers a serious | combinatorial explosion. |
lly increasing number of nodes, leading to | combinatorial explosion. |
Albert has also contributed to the | Combinatorial Game Suite game analysis software, and is |
In | combinatorial game theory, the zero game is the game whe |
finite groups, knot theory, number theory, | combinatorial game theory and coding theory. |
most widely known for his contributions to | combinatorial game theory (CGT), a theory of partisan ga |
stance-regular graphs were introduced as a | combinatorial generalization of distance-transitive grap |
and computer scientist who specializes in | combinatorial geometry and number theory. |
s on computational geometry: Algorithms in | Combinatorial Geometry (Springer-Verlag, 1987, ISBN 9783 |
It inaugurated a new branch of | combinatorial geometry, with many variations and applica |
J. H. C. Whitehead, | Combinatorial homotopy. |
physics and their applications, especially | combinatorial Hopf algebras in integrable systems and qu |
lications, including recurrence relations, | combinatorial identities, binomial coefficients, prime n |
, which allowed computerized proof of many | combinatorial identities. |
The | combinatorial interpretation of the MIM notation was des |
an extensive Markush syntax for specifying | combinatorial libraries and RGROUP queries. |
ired parameters can be selected from large | combinatorial libraries of biopolymers using instrumenta |
), can be used to identify the purity of a | combinatorial library, but assays need to be rapid with |
This model was defined starting from | combinatorial maps in order to represent non-orientable |
ralized maps are sometimes used instead of | combinatorial maps, even to represent orientable closed |
Like | combinatorial maps, generalized maps are used as efficie |
es definitions and algorithms comparing to | combinatorial maps. |
Frankl conjecture, in | combinatorial mathematics |
e's son Mohan Shrikhande is a professor of | combinatorial mathematics at Central Michigan University |
ical composition, starting with systems of | combinatorial mathematics and evolving towards the appli |
thods in reconstruction theory, WL Kocay - | Combinatorial mathematics, IX (Brisbane, 1981), LNM |
In | combinatorial mathematics, a symmetric design is a block |
In | combinatorial mathematics, the Albertson conjecture is a |
In graph theory, a branch of | combinatorial mathematics, a block graph is a type of un |
In | combinatorial mathematics, LCF notation or LCF code is a |
of Ars Combinatoria, a Canadian journal of | combinatorial mathematics, is a founding fellow of the I |
He specializes in | combinatorial mathematics. |
Wilson is known for his work in | combinatorial mathematics. |
is known for his work in BIBD designs and | combinatorial mathematics. |
uished and well-recognized achievements in | combinatorial mathematics. |
e foundations of mathematics and a Ph.D in | combinatorial mathematics. |
rch interests concentrate on geometric and | combinatorial methods in infinite group theory. |
He worked mainly on | combinatorial methods and questions in real analysis, su |
which commercialized the use of high-speed | combinatorial methods for pharmaceutical and genetic res |
n successfully designed by rational and by | combinatorial methods. |
The | combinatorial notation of the zero game is: { | }. |
nts among the cycles of a permutation, the | combinatorial notion of cycle differs from the group the |
s known also for books, with Klaus Roth on | combinatorial number theory, and with H. E. Richert on s |
The Brauer tree is a | combinatorial object associated to a block with cyclic d |
graphs and the action of finite groups on | combinatorial objects. |
It is suited to large-scale | combinatorial optimisation problems. |
He is an expert on data mining, | combinatorial optimisation and e-Science applications. |
In graph theory, the metric k-center, is a | combinatorial optimization problem studied in theoretica |
Some examples of | combinatorial optimization problems that fall into this |
or minmax location problem is a classical | combinatorial optimization problem in operations researc |
thematics, branch and price is a method of | combinatorial optimization for solving integer linear pr |
These problems generalize many problems in | combinatorial optimization including finding maximum mat |
nment problem (QBAP) is one of fundamental | combinatorial optimization problems in the branch of opt |
ient algorithms for network flow and other | combinatorial optimization problems, the identification |
estions about extensions first surfaced in | combinatorial optimization, where extensions arise natur |
heir connections to network flow theory in | combinatorial optimization, to geometry, and to physics. |
eory of algorithms and their applications, | combinatorial optimization, computational complexity, an |
arch encompassed mathematical programming, | combinatorial optimization, production planning, large s |
In | combinatorial optimization, the matroid intersection pro |
In | combinatorial optimization, the Gomory-Hu tree of an und |
Combinatorial Optimization: Algorithms and Complexity (w | |
For | combinatorial phylogenetic modeling, see Mathematical bi |
A complement is in this context half of a | combinatorial pitch class set and most generally a compl |
Also, the | combinatorial point of view seems to take its modern for |
The application takes into account complex | combinatorial possibilities, considering virtually infin |
The basic | combinatorial problem is counting the number of differen |
e application of quantum computing to hard | combinatorial problems arising in machine learning. |
lysis of Practical Parallel Algorithms for | Combinatorial Problems with Applications to Image Proces |
lete in his 1972 paper "Reducibility Among | Combinatorial Problems". |
idence complexes and the study of abstract | combinatorial properties relating vertices, edges, faces |
g the Rubik's Cube craze of the 1980s, one | combinatorial puzzle sold had the form of a rhombicuboct |
tics, the Littlewood-Offord problem is the | combinatorial question in geometry of describing usefull |
recognition for a lifetime contribution to | combinatorial research. |
The QSAR & | Combinatorial Science (usually abbreviated as QSAR Comb. |
R and Modelling Society and the Society of | Combinatorial Sciences. |
Combinatorial search. | |
More extensive design strategies have used | combinatorial sequences to "evolve" ankyrin-repeat motif |
Combinatorial: Similar to heuristic, but all states are | |
tion of sequent along the lines of Joyal's | combinatorial species, allowing the treatment of more dr |
graph method for proving the existence of | combinatorial structures, it is of interest to ask how e |
nd "The magician from Riga" for his daring | combinatorial style. |
This is advantageous in learning a complex | combinatorial system such as a human language because ch |
Symyx offers high-speed | combinatorial technologies for the discovery of new mate |
o on the editorial board of the Journal of | Combinatorial Theory Series B and Combinatorica. |
Hall, Jr., Marshall (1967), | Combinatorial Theory, Blaisdell Publishing, LCCN 67-1110 |
n (1971), "Pancyclic graphs I", Journal of | Combinatorial Theory, Series B 11 (1): 80-84, doi:10.101 |
r and co-editor-in-chief of the Journal of | Combinatorial Theory, Series B. |
nd editor of Combinatorica, the Journal of | Combinatorial Theory, Ser B, Discrete Mathematics, and t |
He worked on the foundations of | combinatorial topology, and proposed that a notion of eq |
A pure | combinatorial VFSM is possible in case only where input |
Selby and Oliver Riordan, which exploited | combinatorial weaknesses of the original puzzle design. |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|