نتایج جستجو برای: automatic programming

تعداد نتایج: 457224  

2016
Xue Bai

One of the best methods of learning in computer programming courses depends on practical exercises accompanied by a good feedback procedure. Feedback on programming assignments has a significant impact on learning; it has been described as the most powerful single motivator that enhances achievement. However, the process of preparing, collecting and grading programming assignments manually take...

2007
Kaustav Nandy Prabhakar R Gudla Stephen J. Lockett

Automatic segmentation of cell nuclei is an essential task in a variety of biomedical applications. However, performance is variable, being typically around 95% correct detection of nuclei depending on the degree of clustering. Furthermore, work to assess and optimize the segmentation accuracy of each nucleus is in its infancy. In this study we developed an algorithm intended for segmentation o...

2005
Heinz Wörn Björn Hein Detlef Mages Berend Denkena Rene Apitz Pawel Kowalski Niels Reimer

Nowadays, industrial robots are preferably programmed offline, i.e. without interference with the real cell and running production processes. Usually a simulation tool is used to manually define individual locations and to check the created raw path for possible collisions. Within this paper an approach is presented, that combines a haptic input device by means of automated path smoothing. The ...

Journal: :Artif. Intell. 1995
Roland Olsson

The paper presents a system, ADATE, for automatic functional programming. ADATE uses speci cations that contain few constraints on the programs to be synthesized and that allow a wide range of correct programs. ADATE can generate novel and unexpected recursive programs with automatic invention of recursive auxiliary functions. Successively better programs are developed using incremental program...

Journal: :Bioinformatics 2003
Ming-Hua Hsieh Wei-Che Hsu Sung-Kay Chiu Chi-Meng Tzeng

SUMMARY We have developed U-PRIMER, a primer design program, to compute a minimal primer set (MPS) for any given set of DNA sequences. The U-PRIMER algorithm, which uses automatic variable fixing and automatic redundant constraint elimination to tackle the binary integer programming problem associated with the MPS selection problem. The program has been tested successfully with 32 adipocyte dev...

1981
Douglas R. Smith

The a l g o r i t h m des ign process proceeds in a t o p down manner w i t h t h e p r o d u c t i o n o f h i ghe r l e v e l a l g o r i t h m s r e s u l t i n g i n t h e gene ra t i on o f s p e c i f i c a t i o n s f o r lower l e v e l a l g o r i t h m s . The work ings o f NAPS are desc r ibed below v i a a d e s c r i p t i o n of t h e main sources o f i n f o r m a t i o n which t...

1973
Elliot B. Koffman Sumner E. Blount

This paper discusses generative computer-assisted instruction (CAI) and its relationship to Artificial Intelligence Research. Systems which have a limited capability for natural language communication are described. In addition, potential areas in which Artificial Intelligence could be applied are outlined. These include individualization of instruction, determining the degree of" accuracy of a...

1983
Gérard D. Guiho

In th i s paper we f i r s t t r y to character ize one meaning of automatic programming. We consider it to be one part of the Programming environment re la ted to A r t i f i c i a l I n te l l i gence techniques. We then i l l u s t r a t e an automatic programning process, on a simple example, using an Abstract Data Type theory to which we add the not ion of schemes which are p a r t i c u l...

2003
E. Mazer

The projected increase in the use of robots in space will make their increased autonomy essential. Direct teleoperation of robots in complicated, repetitive tasks, such M those found in space, can be very tedious. Robot autonomy would relieve the operators from unnecessary fatigue as well as improving reliability and cost (I]. One step towards improving the autonomy of robots consists of having...

2002
Zehra Sura David Chi-Leung Wong Xing Fang Jaejin Lee Samuel P. Midkiff David A. Padua

Concurrent threads of execution running on a shared memory system can access the same memory locations. A consistency model defines constraints on the order of these shared memory accesses. For good run-time performance, these constraints must be as few as possible. Programmers who write explicitly parallel programs must take into account the consistency model when reasoning about the behavior ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید