نتایج جستجو برای: isfahankhajoo neighborhood
تعداد نتایج: 29527 فیلتر نتایج به سال:
A piano fingering indicates which finger should play each note in a piece. Such a guideline is very helpful for both amateur and experienced players in order to play a piece fluently. In this paper, we propose a variable neighborhood search algorithm to generate piano fingerings for complex polyphonic music, a frequently encountered case that was ignored in previous research. The algorithm take...
The AutoGraphiX 2 system is used to compare the index of a connected graph G with a number of other graph theoretical invariants, i.e., chromatic number, maximum, minimum and average degree, diameter, radius, average distance, independence and domination numbers. In each case, best possible lower and upper bounds, in terms of the order of G, are sought for sums, differences, ratios and products...
Information tables provide a convenient and useful tool for representing a set of objects using a group of attributes. This notion is enriched by introducing neighborhood systems on attribute values. The neighborhood systems represent the semantics relationships between, and knowledge about, attribute values. With added semantics, neighborhood based information tables may provide a more general...
A set of vertices S in a graph G is a clique if any two of its vertices are adjacent. The clique number ω is the maximum cardinality of a clique in G. A series of best possible lower and upper bounds on the difference, sum, ratio or product of ω and some other common invariants of G were obtained by the system AGX 2, and most of them proved either automatically or by hand. In the present paper,...
The order batching problem is a part of the picking process of items in a warehouse. A set of items conform an order and a set of orders conform a batch. The problem consist of grouping the orders received in the warehouse in different batches. Each batch have to be collected by a single picker without exceed a capacity limit. The objective is to minimize the total time needed to collect all th...
ing over the relative tense inside the subordinate (marked) clause produces a property of times that can combine with the main (unmarked) clause through set intersection (or predicate modification; Heim & Kratzer 1998:65), as long as it is adjoined low enough to combine with another property of times. This is much like the semantic composition of a temporal adjunct clause (see, for instance, vo...
OBJECTIVE Diabetes-specific distress is an important psychological issue in people with diabetes. The neighborhood environment has the potential to be an important factor for diabetes distress. This study investigates the associations between neighborhood characteristics and diabetes distress in adults with type 2 diabetes. METHODS We used cross-sectional data from a community-based sample of...
We consider neighborhood search defined on combinatorial optimization problems. Suppose that N is a Neighborhood for combinatorial optimization problem X. We say that N′ is LO-equivalent (locally optimal) to N if for any instance of X, the set of locally optimal solutions with respect to N and N′ are the same. The union of two LO-equivalent neighborhoods is itself LO-equivalent to the neighborh...
Objective. The purpose of this article is to explore the additive and moderating effects of neighborhood context on substance use among youth. Methods. Using a regional sample of adolescents and matching the data to Census tracts, we use hierarchical linear modeling to examine the relationship between neighborhood disadvantage and neighborhood instability on alcohol and marijuana use while cont...
This study examines both objective and subjective assessments of neighborhood conditions, exploring the overlap between different sources of information on neighborhoods and the relative strength of their association with adult self-rated health. Data on perceived neighborhood quality from Wave IV (2001/2002) of the nationally representative U.S. Americans Changing Lives study are merged with n...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید