نتایج جستجو برای: even analysis

تعداد نتایج: 3238940  

Journal: :American Journal of Physiology-Heart and Circulatory Physiology 1999

Journal: :The IJICS (International Journal of Informatics and Computer Science) 2020

Journal: :University Management: Practice and Analysis 2017

Journal: :Journal of Computer and System Sciences 2018

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده ادبیات و زبانهای خارجی 1390

bserved by many teachers that most of the time, mumbling and searching for their intended words, students complain why they have forgotten the words they have learned in the previous semesters. they ask for some new ways that may help them to recall and apply the learned words more efficiently, since as they declare one of the most important skills in foreign language learning is having a g...

Journal: :Finite Fields and Their Applications 2007
Jon-Lark Kim Vera Pless

A binary code with the same weight distribution as its dual code is called formally self-dual (f.s.d.). We only consider f.s.d. even codes (codes with only even weight codewords). We show that any formally self-dual even binary code C of length n not divisible by 8 is balanced. We show that the weight distribution of a balanced near-extremal f.s.d. even code of length a multiple of 8 is unique....

2004
Jyri Mustajoki Raimo P. Hämäläinen

This paper introduces an approach to support different phases of the Even Swaps process by Preference Programming, which is a framework for modeling incomplete information within multiattribute value theory. In the approach, the Even Swaps process is carried out as usual, but in parallel the preferences of the decision maker are modeled with a Preference Programming model, which is also updated...

Journal: :SIAM J. Discrete Math. 1994
Raphael Yuster Uri Zwick

We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).

Journal: :Journal of the Mathematical Society of Japan 1991

2015
Prachi Goyal Pranabendu Misra Fahad Panolan Geevarghese Philip Saket Saurabh

Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to obtain a connected graph in which all th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید