نتایج جستجو برای: within a reasonable time
تعداد نتایج: 13766417 فیلتر نتایج به سال:
T he Internet is a wonderful research tool. With the click of a mouse, you can beam yourself into what seems an infinite number of important lectures by eminent thinkers around the world. Just such an opportunity awaits if you search for Richard A. Muller, professor of physics at the University of California, berkeley. The results of such a search include a video of Professor Muller castigating...
Networking and security researchers must grapple with the following four potential constraints in the course of their work: (i) legal issues, (ii) institutional policies, (iii) community norms and (iv) personal ethics. These possible constraints can be intertwined and inform one another. In this position paper we set aside all except the third constraint: community norms. We do not mean to dimi...
Face frontalization is a rising technique for view-invariant face analysis. It enables a non-frontal facial image to recover its general facial appearances to frontal view. A few pioneering works have been proposed very recently. However, face frontalization with detailed facial expression recovering is still very challenging due to the non-linear relationships between head-pose and expression ...
Uncertain statistics is a methodology for collecting and interpreting expert’s experimental data by uncertainty theory. And when we collecting the expert’s experimental data, the expert’s data will maybe affected by psychological factors. In this paper, we are giving a rationality test of expert’s experimental data on linear uncertainty distribution of the uncertainty statistics. The testing di...
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...
We show that for any reasonable semantic model of computation and for any positive integer a and rationals 1 ≤ c < d, there exists a language computable in time n with a bits of advice but not in time n with a bits of advice. A semantic model is one for which there exists a computable enumeration that contains all machines in the model but may also contain others. We call such a model reasonabl...
Objectives: In recent years the manifestation of child abuse as a social disaster came into public attention with the help of public media and caused much controversy and various social reactions. It was against this background that in the past few years much endeavors has gone into the criminalization of different forms of this phenomenon by civil, sociological, psychological and criminol...
Gas-phase acidities of 15 aliphatic carboxylic acids, X CH -,COOH, have been calculated using the MNDO method. Among the substituted groups exist the electron donor alkyl groups and electron acceptor halogens. The average error in acidity is within the experimental uncertainty of the data. Systematic errors have been found for the substituents which form internal hydrogen bondings. A reaso...
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید