نتایج جستجو برای: theoretical problems
تعداد نتایج: 849274 فیلتر نتایج به سال:
Automated planning is a well studied research topic thanks to its wide range of real-world applications. Despite significant progress in this area many planning problems still remain hard and challenging. Some techniques such as learning macro-operators improve the planning process by reformulating the (original) planning problem. While many encouraging practical results have been derived from ...
A major component of computer chip design is creating an optimal physical layout of a netlist, i.e., determining where to place the functional elements and how to route the wires connecting them when manufacturing a chip. Because of its basic structure, the overall problem of netlist layout contains many questions that lend themselves to graph theoretical modeling and analysis. We will describe...
The timing of this focussed research group (FRG) was excellent. Five of the six participants (from Canada, Spain, and the UK) are all involved in a 3-year research programme funded by the UK Engineering and Physical Sciences Research Council (EPSRC) for the three year period, July 1, 2007 to June 30, 2010. Thus, the FRG provided a golden opportunity to reflect on achievements under this aegis, ...
Let T be a unit equilateral triangle, and T1, . . . , Tn be n equilateral triangles that cover T and satisfy the following two conditions: (i) Ti has side length ti (0 < ti < 1); (ii) Ti is placed with each side parallel to a side of T . We prove a conjecture of Zhang and Fan asserting that any covering that meets the above two conditions (i) and (ii) satisfies ∑n i=1 ti ≥ 2. We also show that ...
Evidence-based treatments and preventive interventions in the child and family area have not met with widespread adoption by practitioners. Despite the high prevalence of child behavioral and emotional problems, many parents and families in need are not receiving or participating in services, and when they do, the most efficacious interventions are not what is usually provided. Simultaneously a...
Article history: Received 15 April 2014 Received in revised form 29 September 2014 Accepted 28 October 2014 Available online 4 November 2014
Let F denote the class of all functions univalent in the unit disk and convex in the direction of the real axis. In the paper we discuss the functions of the class F which are n-fold symmetric, where n is positive even integer. For the class of such functions we find the Koebe set as well as the covering set, i.e. T f2F f ðDÞ and S f2F f ðDÞ. Moreover, the Koebe constant and the covering consta...
For every fixed graph H, we determine the H-covering number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, C(H,Kn) = d dn 2h dn− 1 d ee, unless d is even, n = 1 mod d and n(n− 1)/d+ 1 = 0 mod (2h/d), in which case C(H,Kn) = d ( n 2 ) h e+ 1. Our m...
CA2 (Continuum Analysis, 2- dimensional) is a computer program developed by the author. CA2 can solve a variety of complex geotechnical problems using explicit finite difference method. In this paper, an introduction will be given to the theoretical and numerical basis of the program and the capability of the code will be shown by solving a few interesting nonlinear and transient problems. Fina...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید