全文获取类型

收费全文 |
2443篇 |

国内免费 |
4篇 |

完全免费 |
49篇 |

专业分类

自动化技术 |
2496篇 |

出版年

2019年 |
2篇 |

2018年 |
26篇 |

2017年 |
33篇 |

2016年 |
62篇 |

2015年 |
91篇 |

2014年 |
132篇 |

2013年 |
131篇 |

2012年 |
105篇 |

2011年 |
178篇 |

2010年 |
117篇 |

2009年 |
171篇 |

2008年 |
150篇 |

2007年 |
142篇 |

2006年 |
106篇 |

2005年 |
138篇 |

2004年 |
106篇 |

2003年 |
100篇 |

2002年 |
99篇 |

2001年 |
62篇 |

2000年 |
61篇 |

1999年 |
65篇 |

1998年 |
50篇 |

1997年 |
53篇 |

1996年 |
48篇 |

1995年 |
38篇 |

1994年 |
39篇 |

1993年 |
38篇 |

1992年 |
11篇 |

1991年 |
23篇 |

1990年 |
27篇 |

1989年 |
12篇 |

1988年 |
9篇 |

1987年 |
8篇 |

1986年 |
15篇 |

1985年 |
5篇 |

1984年 |
5篇 |

1983年 |
17篇 |

1982年 |
6篇 |

1980年 |
2篇 |

1979年 |
4篇 |

1978年 |
1篇 |

1977年 |
1篇 |

1976年 |
1篇 |

1975年 |
1篇 |

1974年 |
4篇 |

1969年 |
1篇 |

**排序方式：**共有2496条查询结果，搜索用时 140 毫秒

1.

A new look at the statistical model identification

**总被引：88，自引：0，他引：88**The history of the development of statistical hypothesis testing in time series analysis is reviewed briefly and it is pointed out that the hypothesis testing procedure is not adequately defined as the procedure for statistical model identification. The classical maximum likelihood estimation procedure is reviewed and a new estimate minimum information theoretical criterion (AIC) estimate (MAICE) which is designed for the purpose of statistical identification is introduced. When there are several competing models the MAICE is defined by the model and the maximum likelihood estimates of the parameters which give the minimum of AIC defined by AIC = (-2)log-(maximum likelihood) + 2(number of independently adjusted parameters within the model). MAICE provides a versatile procedure for statistical model identification which is free from the ambiguities inherent in the application of conventional hypothesis testing procedure. The practical utility of MAICE in time series analysis is demonstrated with some numerical examples. 相似文献

2.

Using Rough Sets with Heuristics for Feature Selection

**总被引：31，自引：0，他引：31**Practical machine learning algorithms are known to degrade in performance (prediction accuracy) when faced with many features (sometimes attribute is used instead of feature) that are not necessary for rule discovery. To cope with this problem, many methods for selecting a subset of features have been proposed. Among such methods, the

*filter*approach that selects a feature subset using a preprocessing step, and the*wrapper*approach that selects an optimal feature subset from the space of possible subsets of features using the induction algorithm itself as a part of the evaluation function, are two typical ones. Although the filter approach is a faster one, it has some blindness and the performance of induction is not considered. On the other hand, the optimal feature subsets can be obtained by using the wrapper approach, but it is not easy to use because of the complexity of time and space. In this paper, we propose an algorithm which is using rough set theory with greedy heuristics for feature selection. Selecting features is similar to the filter approach, but the evaluation criterion is related to the performance of induction. That is, we select the features that do not damage the performance of induction. 相似文献3.

Application of interactive genetic algorithm to fashion design

**总被引：24，自引：0，他引：24**In general, computer-aided design support systems have got an approach of traditional artificial intelligence, which statistically analyzes data such as the behavior of designer, to extract formal design behavior. This approach, however, can neither deal with continuous change of fashion nor reflect personal taste well, as it just depends on large amount of collected data. To overcome this sort of problem interactive genetic algorithm (IGA) has been recently proposed, as a new trend of evolutionary computation. IGA uses human's response as fitness value when the fitness function cannot be explicitly defined. This enables IGA to be applied to artistic domains, and we propose a fashion design aid system using it. Unlike the previous works that attempt to model the dress design by several spline curves, the proposed system is based on a new encoding scheme that practically describes a dress with three parts: body and neck, sleeve, and skirt. By incorporating the domain-specific knowledge into the genotype, we could develop a more realistic design aid system for women’s dress. We have implemented the system with OpenGL and VRML to enhance the system interface. The experiments with several human subjects show that the IGA approach to dress design aid system is promising. 相似文献

4.

A Review and Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms

**总被引：16，自引：0，他引：16**Many lazy learning algorithms are derivatives of the k-nearest neighbor (k-NN) classifier, which uses a distance function to generate predictions from stored instances. Several studies have shown that k-NN's performance is highly sensitive to the definition of its distance function. Many k-NN variants have been proposed to reduce this sensitivity by parameterizing the distance function with feature weights. However, these variants have not been categorized nor empirically compared. This paper reviews a class of weight-setting methods for lazy learning algorithms. We introduce a framework for distinguishing these methods and empirically compare them. We observed four trends from our experiments and conducted further studies to highlight them. Our results suggest that methods which use performance feedback to assign weight settings demonstrated three advantages over other methods: they require less pre-processing, perform better in the presence of interacting features, and generally require less training data to learn good settings. We also found that continuous weighting methods tend to outperform feature selection algorithms for tasks where some features are useful but less important than others. 相似文献

5.

6.

An improved model for vehicle routing problem with time constraint based on genetic algorithm

**总被引：13，自引：0，他引：13** Heung-Suk Hwang 《Computers & Industrial Engineering》2002,42(2-4):361-369

A vehicle routing problem (VRP) with time constraint is one of the important problems in distribution and transportation. Thus the generic VRP and its practical extensions are discussed in great detail in the literatures. In the VRP, the service of a customer must start and finish within a given time interval. The objective of this problem is to minimize the cost of servicing the set of customers without being tardy or exceeding the capacity or travel time of the vehicles. In this research we concentrated on developing a GA–TSP model by improving the genetic algorithm (GA) operators and the initial population. For the computational purpose, we developed a GUI (graphic user interface)-type computer program according to the proposed method. The computational results show that the proposed method is very effective on a set of standard test problems and it can be potentially useful in solving the VRPs. 相似文献

7.

Evaluation of the number of rehandles in container yards

**总被引：13，自引：0，他引：13** Kap Hwan Kim 《Computers & Industrial Engineering》1997,32(4):701-711

The rehandling work influences the performance of transfer cranes significantly in a container terminal. The height and the width of a bay in the container stack are important decision variables in designing the storage configuration. And they are key factors which determine the average number of rehandles to pick up a container. In this paper, we propose a methodology to estimate the expected number of rehandles to pick up an arbitrary container and the total number of rehandles to pick up all the containers in a bay for a given initial stacking configuration. Simple tables and equations are provided to help the estimation of the number of rehandles. 相似文献

8.

Towards Creative Evolutionary Systems with Interactive Genetic Algorithm

**总被引：12，自引：0，他引：12** Sung-Bae Cho 《Applied Intelligence》2002,16(2):129-138

Evolutionary computation has shown a great potential to work out several real-world problems in the point of optimization, but it is still quite far from realizing a system of matching the human performance. Especially, in creative applications such as architecture, art, music, and design, it is difficult to evaluate the fitness because the measure depends mainly on the human mind. To overcome this shortcoming, this paper presents a novel technique, called interactive genetic algorithm (IGA), which performs optimization with human evaluation and the user can obtain what he has in mind through repeated interaction with. To show the usefulness of the IGA to develop effective human-oriented evolutionary systems, we have applied it to the problems of fashion design and emotion-based image retrieval. Experiments with several human subjects indicate that the IGA approach is promising to develop creative evolutionary systems. 相似文献

9.

Extraction of specific signals with temporal structure

**总被引：12，自引：0，他引：12**In this work we develop a very simple batch learning algorithm for semiblind extraction of a desired source signal with temporal structure from linear mixtures. Although we use the concept of sequential blind extraction of sources and independent component analysis, we do not carry out the extraction in a completely blind manner; neither do we assume that sources are statistically independent. In fact, we show that the a priori information about the autocorrelation function of primary sources can be used to extract the desired signals (sources of interest) from their linear mixtures. Extensive computer simulations and real data application experiments confirm the validity and high performance of the proposed algorithm. 相似文献

10.

Algorithms for Distributed Constraint Satisfaction: A Review

**总被引：12，自引：0，他引：12**When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. Various application problems in multi-agent systems can be formalized as distributed CSPs. This paper gives an overview of the existing research on distributed CSPs. First, we briefly describe the problem formalization and algorithms of normal, centralized CSPs. Then, we show the problem formalization and several MAS application problems of distributed CSPs. Furthermore, we describe a series of algorithms for solving distributed CSPs, i.e., the asynchronous backtracking, the asynchronous weak-commitment search, the distributed breakout, and distributed consistency algorithms. Finally, we show two extensions of the basic problem formalization of distributed CSPs, i.e., handling multiple local variables, and dealing with over-constrained problems. 相似文献