Search results for "languages"
showing 10 items of 2101 documents
"Table 7" of "Search for a heavy top-quark partner in final states with two leptons with the ATLAS detector at the LHC"
2012
(1) Observed CLs values for the scalar top signal grid (2) Expected CLs values for the scalar top signal grid.
"Table 60" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…
2013
observed CLs values for the best expected combination in the M(chargino), M(neutralino) plane in the scenario where M(stop) = 180 GEV.
"Table 59" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…
2013
expected CLs values for the best expected combination in the M(chargino), M(neutralino) plane in the scenario where M(stop) = 180 GEV.
"Table 65" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…
2013
expected CLs values for the best expected combination in the M(stop), M(neutralino) plane in the scenario where M(chargino) = 106 GEV.
"Table 66" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…
2013
observed CLs values for the best expected combination in the M(stop), M(neutralino) plane in the scenario where M(chargino) = 106 GEV.
Курсъ сравнительной морфологіи индоэвропэйских языковъ: читанъ въ 1909-10 уч. г. въ С-Петербургскомъ Ун-тѣ
1910
Rokraksta litogrāfijas sējums
Anleitung zum Studien der Sanskrit-Sprache
1871
Mācību materiāls studiju vajadzībām ietver skaidrojošu ievadtekstu par sanskritu, sanskrita- vācu vārdnīcu ar atsaucēm uz Rigvēdas tekstu un atsevišķu tulkojošo daļu pie 'Hymnen des Rigvēdas". Manuskripts rokrakstā, datējums nav precīzi zināms.
ADT implementation and completion by induction from examples
1991
There exists a fast algorithm [2] for inductive synthesis of terminating and ground confluent term rewriting systems from samples. The principles of this algorithm and the methodology of its use for implementation and completion of abstract data types are described.
Inductive synthesis of term rewriting systems
2005
Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.
Tar ekun dunnǝ industrializacijan
1933
Apskats par Padomju Savienības rūpniecības attīstību. Tulkojums no krievu valodas evenku valodā.