小窓モード

プレミアム

ログイン
設定

設定

「problem」の共起表現一覧(2語右が「be」)

該当件数 : 66



This problem can be fixed.
Almost any boolean reasoning problem can be expressed as a SAT problem.
The problem must be identified and the faulty part identi
The NP-completeness of the decision problem can be shown using a reduction from the Hamil
on methods for facility location problems the problem will be reduced to instances of continuous kn
h the unit of mass, which allows the two-body problem to be solved as if it were a one-body problem
pi) and c(qj) are positive, this maximization problem can be formulated as a minimization problem i
In the case of dynamical spacetimes, the problem may be divided into the initial value problem
from which the problem can be solved using the method of the last mu
Thus, the problem may be solved in polynomial time whenever k i
The expression problem can be treated as a use case in programming l
formal specification correctly describes the problem to be solved is a separate issue.
The problem can be relatively easily eliminated by making
ld take the better part of a century for this problem to be resolved.
For the case of dust, the problem can be solved by using the Bianchi identities
In any case, the first problem to be run on the ENIAC which took advantage o
situation where all reasonable solutions to a problem must be complicated (and possibly confusing)
hat it is just as absurd to assume that every problem can be solved.
Lester Brown believes this problem might be solved by the government establishin
The keeper considered the biggest maintenance problem to be the prevention of sand accumulation at
The derivatization problem can be resolved by cleaving large peptides in
More recent work has suggested the problem may be indirect evidence of a cyclic universe
The solution to the assignment problem will be whichever combination of taxis and cu
icle does not have references, then that is a problem to be resolved for that article.
be used together with the floor function, the problem can be solved in O(n) time.
r function is computable in constant time the problem can be solved in O(n log log n) time.
sm argue that it is arrogant to assume that a problem cannot be solved just because we have not sol
model is that no part of the solution of the problem can be perpetuated "upstream".
be the set of equipments purchased, then the problem can be formulated as,
On some occasions, this problem can be fixed by using the Update Service soft
Yorkshire PTE has also been lobbying for this problem to be addressed (as noted in its 2006 Rail St
rgy the child previously put into the Oedipal problem can be used for developing the self.
This problem can be avoided either by incorporating sand o
By the second definition, any decision problem can be shown to be decidable by exhibiting an
ARS with the Church-Rosser property the word problem may be reduced to the search for a common suc
This problem can be rectified by deriving the force law fr
This problem can be alleviated by testing a random non-exi
ht construction of an automaton such that the problem can be answered.
This problem can be solved by using CT with 1 ampere secon
Hud who suspects what the problem might be when Homer tells him the origin of t
e literature is limited, but some idea of the problem can be gained from past small scale studies.
They began by noting that the Generals' Problem can be reduced to solving a "Commander and Li
Any algorithm for the widest path problem can be transformed into an algorithm for the
An extremely simple planning problem would be one where you had two words and one
ts concern that the settlement of the refugee problem not be at what it considers the expense of Le
The trans-Planckian problem can be conveniently considered in the framewo
Another problem would be keeping the acceleration of the Star
m privileged backgrounds, she argues that the problem cannot be a mere matter of the school system
The problem may be visualized as placing the vertices of
This problem can be minimized by using methods that correc
the protein of interest is too large for the problem to be tractable by DEE.
The birthday problem can be generalized as follows: given n random
s cannot be doubted, but what sort of hearing problem would be so severe as to make him unfit for t
The boolean satisfiability problem can be viewed as the special case where all v
In the past, the problem could be solved simply by lighting a stove or
This problem can be mitigated, however, by deploying an ap
ical to making policy decisions; however this problem may be mitigated if genetic markers are used
ement covering all aspects of the Middle East problem can be reached."
m Universe may have allowed a solution to the problem to be found, which was helped by a new Doctor
f pamphlets "in which the nature of the Irish problem could be explored and, as a result, more succ
finite array of point dipoles the scattering problem may be solved exactly, so the only approximat
The majority problem cannot be solved perfectly if it is required
ssumed lightly; for example a patient's liver problem might be caused by hepatitis and abuse of alc
of Ω(n log n) for time complexity of the EMST problem can be established in restricted models of co
plexity class NP in the sense that a decision problem can be expressed in existential second-order
graph approach to the Euclidean shortest path problem may be sped up by forming a graph from the bi
                                                                                                   


こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する
英→日 日→英
こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する

©2024 GRAS Group, Inc.RSS