Detaylı Arama

Bulunan: 21 Adet 0.001 sn
- Eklemek veya çıkarmak istediğiniz kriterleriniz için 'Dahil' / 'Hariç' seçeneğini kullanabilirsiniz. Sorgu satırları birbirine 'VE' bağlacı ile bağlıdır.
- İptal tuşuna basarak normal aramaya dönebilirsiniz.
Bulunan: 21 Adet 0.001 sn
Koleksiyon [4]
Tam Metin [1]
Yazar [20]
Yayın Türü [1]
Konu Başlıkları [20]
Yayın Tarihi [1]
Dergi Adı [18]
Yayıncı [9]
Dil [2]
Yazar Departmanı [1]
Memetic algorithms for nurse rostering

Özean, E.

Conference Object | 2005 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)3733 LNCS , pp.482 - 492

Nurse rostering problems represent a subclass of scheduling problems that are hard to solve. The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions. In this paper, a real case of a nurse rostering problem is introduced. Memetic Algorithms utilizing different type of promising genetic operators and a self adaptive violation directed hierarchical hill climbing method are presented based on a previously proposed framework. © Springer-Verlag Berlin Heidelberg 2005.

Alternative clustering by utilizing multi-objective genetic algorithm with linked-list based chromosome encoding

Du, J. | Korkmaz, E.E. | Alhajj, R. | Barker, K.

Conference Object | 2005 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)3587 LNAI , pp.346 - 355

In this paper, we present a linked-list based encoding scheme for multiple objectives based genetic algorithm (GA) to identify clusters in a partition. Our approach obtains the optimal partitions for all the possible numbers of clusters in the Pareto Optimal set returned by a single genetic GA run. The performance of the proposed approach has been tested using two well-known data sets, namely Iris and Ruspini. The obtained results are promising and demonstrate the applicability and effectiveness of the proposed approach. © Springer-Verlag Berlin Heidelberg 2005.

Investigation of the effects of static and 50Hz electromagnetic fields on intrauterine rat bones using DEXA analysis

Okudan, B | Keskin, AU | Aydin, A | Cesur, G | Comlekci, S | Suslu, H


Reducing power dissipation of register alias tables in high-performance processors

G. Kucuk | O. Ergin | D. Ponomarev | K. Ghose

Conference Object | 2005 | IEE Proceedings: Computers and Digital Techniques152 ( 6 ) , pp.739 - 746

Modern microprocessor designs implement register renaming using register alias tables (RATs) which maintain the mapping between architectural and physical registers. Because of the non-trivial power that is dissipated in a disproportionately small area, the power density in the RAT is significantly higher than in some other datapath components. Mechanisms are proposed to reduce the RAT power and the power density by exploiting the fundamental observation that most of the generated register values are used by the instructions in close proximity to the instruction producing a value. The first technique disables the RAT lookup for a so . . .urce register if that register is a destination of an earlier instruction dispatched in the same cycle. The second technique eliminates some of the remaining RAT read accesses, even if the source register value is produced by an instruction dispatched in an earlier cycle. This is done by buffering a small number of recent register address translations in a set of external latches and satisfying some RAT lookup requests from these latches. The net result of applying both techniques is a 30% reduction in the RAT energy with no performance penalty, little additional complexity and no cycle time degradation. © IEE, 2005 Daha fazlası Daha az

Limited painful mouth opening

Güler, N. | Yumuk, P.F. | Ilguy, D. | Olgac, V. | Greer, J.

Conference Object | 2005 | Journal of Oral and Maxillofacial Surgery63 ( 8 ) , pp.1201 - 1205

[No abstract available]

What does the automorphism group of a free abelian group A know about A?

Tolstykh, V

Conference Object | 2005 | Logic and Its Applications380 , pp.283 - 296

Let A be an infinitely generated free abelian group. We prove that the automorphism group Aut(A) first-order interprets the full second-order theory of the set vertical bar A vertical bar with no structure. In particular, this implies that the automorphism groups of two infinitely generated free abelian groups A(1), A(2) are elementarily equivalent if and only if the sets vertical bar A(1)vertical bar, vertical bar A(2)vertical bar are second-order equivalent.

Channel modeling and estimation for robust MC-SS systems

Şenay, S. | Akan, A. | Chaparro, L.F.

Conference Object | 2005 | 13th European Signal Processing Conference, EUSIPCO 2005 , pp.1343 - 1346

As a spread spectrum technique, multi-carrier spread spectrum (MC-SS) systems are able to mitigate the effects of fading, interferences and Doppler frequency shifts as well as to support multiple access schemes. It is possible to get optimum performance from MC-SS systems by carefully choosing the spreading sequences. However, due to inter-user interferences performance degrades as the number of users increases unless the transmission channels are modeled and estimated. In this paper, we present a new spreading sequence obtained from a complex quadratic sequence multiplied by a pseudo random noise sequence, thus exploiting the prope . . .rties of constant envelope and statistical independence. The properties of the new spreading sequence enable us to estimate the multi-user channels and design a receiver that is robust to interference and intentional jammers. The performance of the proposed system is illustrated by simulations Daha fazlası Daha az

Effective data mining by integrating genetic algorithm into the data preprocessing phase

Gopalan, J. | Korkmaz, E. | Alhajj, R. | Barker, K.

Conference Object | 2005 | Proceedings - ICMLA 2005: Fourth International Conference on Machine Learning and Applications2005 , pp.331 - 336

Dividing a data set into a training set and a test set is a fundamental component in the pre-processing phase of data mining (DM). Effectively, the choice of the training set is an important factor in deriving good classification rules. Traditional approach for association rules mining divides the dataset into training set and test set based on statistical methods. In this paper, we highlight the weaknesses of the existing approach and hence propose a new methodology that employs genetic algorithm (GA) in the process. In our approach, the original dataset is divided into sample and validation sets. Then, GA is used to find an approp . . .riate split of the sample set into training and test sets. We demonstrate through experiments that using the obtained training set as the input to an association rules mining algorithm generates high accuracy classification rules. The rules are tested on the validation set for accuracy. The results are very satisfactory; they demonstrate the applicability and effectiveness of our approach. © 2005 IEEE Daha fazlası Daha az

The effect of balance abnormalities on the risk of falling in elderly people

Bozan, O | Kocak, G | Pinar, L

Conference Object | 2005 | OSTEOPOROSIS INTERNATIONAL16 ( 12 ) , pp.2198 - 2198

Hand gesture recognition using artificial neural networks

Göknar, G. | Yildirim, T.

Conference Object | 2005 | Proceedings of the IEEE 13th Signal Processing and Communications Applications Conference, SIU 20052005 , pp.210 - 213

In order for humans to interact with computers a fast and easy way is to use hand gestures. The aim of this project is the recognition of hand gestures using an inexpensive camera with fast computation time. For this purpose, a classifier system using Multilayer Perceptron and Radial Basis Function neural networks and image geometrics is proposed for the recognition of hand gestures. © 2005 IEEE.

Final Exam Scheduler - FES

Özcan, E. | Ersoy, E.

Conference Object | 2005 | 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings2 , pp.1356 - 1363

Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for representing timetabling problem instances. In this paper, a framework for designing memetic algorithms (MAs) to solve timetabling problems is described and a tool, named Final Exam Scheduler (FES) is introduced. FES is the first tool that accepts Timetabling Markup Language (TTML) documents as input. It utilizes an MA with an adaptive violation directed hierarchical hill climbing method for solving examination timetabling problem instances. Experimental results o . . .n a set of benchmark data indicate the success of MA. © 2005 IEEE Daha fazlası Daha az

6698 sayılı Kişisel Verilerin Korunması Kanunu kapsamında yükümlülüklerimiz ve çerez politikamız hakkında bilgi sahibi olmak için alttaki bağlantıyı kullanabilirsiniz.

Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.