標(biāo)題: Titlebook: Exploring Computer Science with Scheme; Oliver Grillmeyer Textbook 1998 Springer-Verlag New York 1998 algorithms.artificial intelligence.c [打印本頁(yè)] 作者: 要旨 時(shí)間: 2025-3-21 17:39
書(shū)目名稱Exploring Computer Science with Scheme影響因子(影響力)
書(shū)目名稱Exploring Computer Science with Scheme影響因子(影響力)學(xué)科排名
書(shū)目名稱Exploring Computer Science with Scheme網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Exploring Computer Science with Scheme網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Exploring Computer Science with Scheme被引頻次
書(shū)目名稱Exploring Computer Science with Scheme被引頻次學(xué)科排名
書(shū)目名稱Exploring Computer Science with Scheme年度引用
書(shū)目名稱Exploring Computer Science with Scheme年度引用學(xué)科排名
書(shū)目名稱Exploring Computer Science with Scheme讀者反饋
書(shū)目名稱Exploring Computer Science with Scheme讀者反饋學(xué)科排名
作者: interlude 時(shí)間: 2025-3-21 21:08
abstracting a problem; * creating pseudo code as an intermediate solution; * top-down and bottom-up design; * building procedural and data abstractions; * writing progams in modules which are easily testable. Numerous exercises help the readers test their understanding of the material and develop some ideas i978-1-4757-2937-5作者: 老人病學(xué) 時(shí)間: 2025-3-22 02:17
Springer-Verlag New York 1998作者: FAR 時(shí)間: 2025-3-22 06:48
Heavy-Fermion Superconductor , ,rst computing devices were mechanical in nature! If s the particular set of functions that the computer performs that separates it from microwave ovens or stereos, which are also electronic devices that perform well-defined functions.作者: 飛鏢 時(shí)間: 2025-3-22 09:36 作者: 把…比做 時(shí)間: 2025-3-22 16:30
https://doi.org/10.1007/978-3-0348-5502-0t/output (often abbreviated as I/O) in Scheme. Input is a product of the interpreter reading in our requests at the > prompt. Output is the results of evaluating our input Scheme expressions that the interpreter prints out.作者: 把…比做 時(shí)間: 2025-3-22 17:14
Introduction to Computer Science,rst computing devices were mechanical in nature! If s the particular set of functions that the computer performs that separates it from microwave ovens or stereos, which are also electronic devices that perform well-defined functions.作者: 卵石 時(shí)間: 2025-3-22 22:35
Conditionals, an important element that separates computers from simpler computational devices. Control operations allow decisions to be made. Different actions are taken based on the given conditions. Lef s look at how Scheme handles control.作者: 接觸 時(shí)間: 2025-3-23 04:56 作者: declamation 時(shí)間: 2025-3-23 08:21 作者: 博識(shí) 時(shí)間: 2025-3-23 10:48 作者: Gustatory 時(shí)間: 2025-3-23 16:12
Authentication and Secret-Key Cryptology, an important element that separates computers from simpler computational devices. Control operations allow decisions to be made. Different actions are taken based on the given conditions. Lef s look at how Scheme handles control.作者: Absenteeism 時(shí)間: 2025-3-23 21:02
https://doi.org/10.1007/978-3-030-26867-1irst twenty numbers in a list. We may want to return the first symbol in a list. To carry out such actions the technique of . can be used. It is essential to master recursion, as it is commonly used in Scheme programming. There are different types of recursion that we will explore individually. The 作者: 字形刻痕 時(shí)間: 2025-3-23 22:52 作者: defeatist 時(shí)間: 2025-3-24 04:18
E. Cerny,B. Berkane,P. Girodias,K. Khordoc until some condition is met. Iterative functions provide a means of carrying out these commonly performed tasks without having to explicitly create recursive functions. In general, any linear recursive function (a function with a single recursive call in each of its recursive cases) can be written 作者: Density 時(shí)間: 2025-3-24 07:35 作者: 規(guī)范就好 時(shí)間: 2025-3-24 10:51
Studies in Fuzziness and Soft Computing allows one to access, insert, delete, and modify information stored within a computer system. The term computer system is used as opposed to computer because external memory may be needed. Database systems often require large amounts of memory that greatly exceed the storage capacities of the compu作者: 線 時(shí)間: 2025-3-24 16:00
https://doi.org/10.1007/978-4-431-54514-9itten in a high-level language into programs that perform that same task in machine language. These machine-language programs can then be run on the computer. A . produces machine language that is to be run on a different machine than the one on which the compiler runs. This is helpful when the comp作者: 皮薩 時(shí)間: 2025-3-24 21:11 作者: 女歌星 時(shí)間: 2025-3-24 23:42
Suresh P. Sethi FRSC,Qing Zhangumber of accomplishments. Artificial intelligence, or AI as it is usually referred to, is so popular because it is the most controversial field within computer science. AI is threatening to some people and exciting to others. Some say it is an idea that is a few years away from becoming reality, whi作者: Externalize 時(shí)間: 2025-3-25 04:45 作者: 眉毛 時(shí)間: 2025-3-25 10:46
https://doi.org/10.1007/978-1-4757-2937-5algorithms; artificial intelligence; computer; computer science; data structures; database; fuzzy; fuzzy lo作者: 衍生 時(shí)間: 2025-3-25 13:31
Undergraduate Texts in Computer Sciencehttp://image.papertrans.cn/e/image/319474.jpg作者: 不安 時(shí)間: 2025-3-25 16:10
SpringerBriefs in Computer ScienceAt this point we begin to use a real programming language to perform tasks and solve problems. The programming language used is Scheme, which is a dialect of LISP. Lisp is an acronym for LISt Processing. We will define what a list is and how Scheme goes about processing lists in Chapter 4.作者: 珠寶 時(shí)間: 2025-3-25 23:19
Antonia Parmeggiani,Jacopo PruccoliInformation stored within a computer system is called .. The types of data we have seen are numbers and symbols. Collectively, these are called ..作者: PAGAN 時(shí)間: 2025-3-26 04:11 作者: Fortuitous 時(shí)間: 2025-3-26 05:30 作者: admission 時(shí)間: 2025-3-26 08:54
Programming the Computer,At this point we begin to use a real programming language to perform tasks and solve problems. The programming language used is Scheme, which is a dialect of LISP. Lisp is an acronym for LISt Processing. We will define what a list is and how Scheme goes about processing lists in Chapter 4.作者: antedate 時(shí)間: 2025-3-26 13:46
Lists: The Basic Data Structure,Information stored within a computer system is called .. The types of data we have seen are numbers and symbols. Collectively, these are called ..作者: 漂泊 時(shí)間: 2025-3-26 19:52
Data Structures,We have looked at Scheme’s most common data structure, the list. We have seen how ordered lists and hierarchies can be represented. The focus in this chapter is on using data structures like these and other more abstract data structures in programs.作者: 雀斑 時(shí)間: 2025-3-27 00:19 作者: DEFT 時(shí)間: 2025-3-27 05:07
Introduction to Computer Science,rst computing devices were mechanical in nature! If s the particular set of functions that the computer performs that separates it from microwave ovens or stereos, which are also electronic devices that perform well-defined functions.作者: BLA 時(shí)間: 2025-3-27 07:18
Problem Solving and Problem Abstraction,encounter and solve a number of problems without paying attention to them. You might be looking for cream of asparagus soup. You have techniques that you use to find this particular flavor of soup. You probably don’t look for it among the frozen pizzas. You may ask someone where it can be found to n作者: 永久 時(shí)間: 2025-3-27 09:27
Conditionals, an important element that separates computers from simpler computational devices. Control operations allow decisions to be made. Different actions are taken based on the given conditions. Lef s look at how Scheme handles control.作者: 招惹 時(shí)間: 2025-3-27 14:17
Repetition Through Recursion,irst twenty numbers in a list. We may want to return the first symbol in a list. To carry out such actions the technique of . can be used. It is essential to master recursion, as it is commonly used in Scheme programming. There are different types of recursion that we will explore individually. The 作者: 現(xiàn)暈光 時(shí)間: 2025-3-27 20:02 作者: 數(shù)量 時(shí)間: 2025-3-28 00:54
Repetition Through Iteration, until some condition is met. Iterative functions provide a means of carrying out these commonly performed tasks without having to explicitly create recursive functions. In general, any linear recursive function (a function with a single recursive call in each of its recursive cases) can be written 作者: amenity 時(shí)間: 2025-3-28 02:52
Advanced Uses of Functions,name that matches directly with an argument when the function is called. These functions must be called with a fixed number of arguments. We can create functions that take a variable number of arguments. This is done by specifying one parameter after the function name and a period (making a function作者: BRINK 時(shí)間: 2025-3-28 08:06 作者: 箴言 時(shí)間: 2025-3-28 13:19
Compilers and Interpreters,itten in a high-level language into programs that perform that same task in machine language. These machine-language programs can then be run on the computer. A . produces machine language that is to be run on a different machine than the one on which the compiler runs. This is helpful when the comp作者: Malleable 時(shí)間: 2025-3-28 14:40 作者: glacial 時(shí)間: 2025-3-28 19:53 作者: collagen 時(shí)間: 2025-3-29 01:03
Soft Computing: Fuzzy Logic, Neural Networks, and Genetic Algorithms,c reasoning is further divided into belief networks, genetic algorithms, and chaos theory. What all of these subfields share is an adherence to nonexact computation. Up until now, we have been using formal Boolean logic, which says that something is either true or false, yes or no, black or white. T作者: AVANT 時(shí)間: 2025-3-29 04:32
ing a problem-solving approach and on providing a survey of all of the most important topics covered in computer science degree programmes. Scheme is used throughout as the programming language and the author stresses a functional programming approach which concentrates on the creation of simple fun作者: hypnogram 時(shí)間: 2025-3-29 07:34 作者: Recess 時(shí)間: 2025-3-29 13:03
https://doi.org/10.1007/978-4-431-54514-9omputer. A . produces machine language that is to be run on a different machine than the one on which the compiler runs. This is helpful when the computer for which the machine language is being produced is not readily available (e.g., a developmental machine).作者: FLING 時(shí)間: 2025-3-29 16:59
Suresh P. Sethi FRSC,Qing Zhang computer science. AI is threatening to some people and exciting to others. Some say it is an idea that is a few years away from becoming reality, while others say it will never be a possibility. Some say ifs hip; others, hype. How can one field elicit such disparate beliefs? The answer lies in what AI attempts to do.作者: 商品 時(shí)間: 2025-3-29 23:41
Leong Chan,Tugrul U. Daim,Dundar F. Kocaogluct computation. Up until now, we have been using formal Boolean logic, which says that something is either true or false, yes or no, black or white. There are no shades of gray with this type of logic.作者: investigate 時(shí)間: 2025-3-30 00:35
Textbook 1998lem-solving approach and on providing a survey of all of the most important topics covered in computer science degree programmes. Scheme is used throughout as the programming language and the author stresses a functional programming approach which concentrates on the creation of simple functions tha作者: 索賠 時(shí)間: 2025-3-30 07:44 作者: Agnosia 時(shí)間: 2025-3-30 09:02 作者: Immobilize 時(shí)間: 2025-3-30 15:28 作者: 細(xì)微差別 時(shí)間: 2025-3-30 16:46 作者: 難解 時(shí)間: 2025-3-30 21:22 作者: asthma 時(shí)間: 2025-3-31 01:36 作者: 投票 時(shí)間: 2025-3-31 06:35
E. Cerny,B. Berkane,P. Girodias,K. Khordocusing an iterative function. Most of the examples in this chapter are iterative versions of the functions written using recursion in Chapter 6. You should compare the iterative solutions to their recursive counterparts and decide which seems more natural to you.作者: bibliophile 時(shí)間: 2025-3-31 10:41 作者: Hay-Fever 時(shí)間: 2025-3-31 14:34
