نتایج جستجو برای: alignment constraints
تعداد نتایج: 260329 فیلتر نتایج به سال:
Object alignment is one of the basic operations in drawing programs. Current solutions provide mainly three ways for carrying out this operation: either by issuing an alignment command, or by using direct positioning with the help of gravity active points, or by making use of constraints. The first technique has limited functionality, and the other two may be mysterious for a novice. We describ...
Mixed-paradigm process models integrate strengths of procedural and declarative representations like Petri nets Declare. They are specifically interesting for mining because they allow capturing complex behaviour in a compact way. A key research challenge the proliferation mixed-paradigm is lack corresponding conformance checking techniques. In this paper, we address problem by devising first a...
a new integrated model is developed for information systems planning. in this model, entitled hisspm, a combination of the strengths of critical success factors (csf) method, analytic hierarchy process (ahp) technique and genetic algorithms (ga) is used to identify and prioritize the required information systems. this model considers both qualitative and quantitative factors, as well as the imp...
We hypothesise that all electroweak symmetry breaking terms such as fermion masses and the W and Z gauge boson masses arise radiatively from just one explicit symmetry breaking term in the Lagrangian. Our hypothesis is motivated by the lack of experimental support and the lack of predictivity of the standard symmetry breaking scenario. We construct a simple model which illustrates our ideas. We...
Commitments provide a basis for understanding interactions in multiagent systems. Successful interoperation relies upon the interacting parties being aligned with respect to their commitments. However, alignment is nontrivial in a distributed system where agents communicate asynchronously and make different observations. We propose a formalization for commitments that ensures alignment despite ...
Letter-phoneme alignment is usually generated by a straightforward application of the EM algorithm. We explore several alternative alignment methods that employ phonetics, integer programming, and sets of constraints, and propose a novel approach of refining the EM alignment by aggregation of best alignments. We perform both intrinsic and extrinsic evaluation of the assortment of methods. We sh...
In extant phrase-based statistical machine translation (SMT) systems, the translation model relies on word-to-word alignments, which serve as constraints for the subsequent heuristic extraction and scoring processes. Word alignments are usually inferred in a probabilistic framework; yet, only one single best alignment is retained, as if alignments were deterministically produced. In this paper,...
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. This paper describes a new integer program formulation that generates models small enough to be passed to generic solvers. The formulation is a hybrid relating the sparse alignment graph with a compact encoding of the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید