作者: 新娘 時(shí)間: 2025-3-21 22:55
Textbook 2016 in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementar作者: Working-Memory 時(shí)間: 2025-3-22 03:32 作者: 裂口 時(shí)間: 2025-3-22 08:22 作者: 其他 時(shí)間: 2025-3-22 08:50
Optimal Trees and Paths,cts can, for example, be .-.-paths (for given vertices?. and .) or spanning trees; we will deal with these two cases below. If a weight function . is given, then a feasible solution .???. is called optimal if its weight (also called its cost) .(.):?=?...(.) attains the minimum value over all feasible solutions.作者: choroid 時(shí)間: 2025-3-22 14:46
Fallstudie AeroLas GmbH: State of the Art,ore all occurring natural numbers in the data type .. This, however, is in fact not the case. A variable of type . usually corresponds to a sequence of 4?bytes. This clearly enables us to represent no more than 2. different numbers. In this chapter we will learn how integers are stored.作者: 愉快么 時(shí)間: 2025-3-22 17:26
Erfolgskriterien aus Sicht der Bank,e this assumption, although it is clearly by no means a realistic one for arbitrarily large numbers. Here we will investigate how fast one can actually compute with integers. Here, in a narrower sense, elementary operations only include operations and comparisons restricted to integers in some bound作者: jagged 時(shí)間: 2025-3-22 22:13
https://doi.org/10.1007/978-3-658-21319-0t the occurrence of rounding errors. The elementary operations are, however, comparatively slow because both numerators and denominators can get very large, even if one always reduces fractions to lowest terms with the Euclidean Algorithm.作者: SKIFF 時(shí)間: 2025-3-23 02:55
https://doi.org/10.1007/978-3-658-21319-0not only when inputting data (the number 0.1, for example, has no exact binary representation with finitely many digits; cf. Example?.), but also when using the elementary operations +, ?, ??and ∕. Moreover, the desired answer may be a nonrepresentable number.作者: 殺蟲劑 時(shí)間: 2025-3-23 05:31
https://doi.org/10.1007/3-540-28994-1?the feasible solutions) can usually be represented by subsets of a finite underlying set?.. Often . is the edge set of a graph. In this case the objects can, for example, be .-.-paths (for given vertices?. and .) or spanning trees; we will deal with these two cases below. If a weight function . is 作者: 菊花 時(shí)間: 2025-3-23 10:35 作者: BACLE 時(shí)間: 2025-3-23 14:57
Stefan Hougardy,Jens VygenTextbook covering basic mathematical lecture course.Allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implem作者: 配置 時(shí)間: 2025-3-23 18:56
http://image.papertrans.cn/a/image/152992.jpg作者: Crepitus 時(shí)間: 2025-3-24 01:47
https://doi.org/10.1007/978-3-319-39558-6algorithms; algorithmic mathematics; C++; elementary data structures; sorting algorithms作者: 星星 時(shí)間: 2025-3-24 04:05
Springer International Publishing Switzerland 2016作者: Concrete 時(shí)間: 2025-3-24 06:32
Representations of the Integers,ore all occurring natural numbers in the data type .. This, however, is in fact not the case. A variable of type . usually corresponds to a sequence of 4?bytes. This clearly enables us to represent no more than 2. different numbers. In this chapter we will learn how integers are stored.作者: 供過于求 時(shí)間: 2025-3-24 13:19
Computing with Integers,e this assumption, although it is clearly by no means a realistic one for arbitrarily large numbers. Here we will investigate how fast one can actually compute with integers. Here, in a narrower sense, elementary operations only include operations and comparisons restricted to integers in some bounded interval.作者: Defense 時(shí)間: 2025-3-24 14:59
Approximate Representations of the Real Numbers,t the occurrence of rounding errors. The elementary operations are, however, comparatively slow because both numerators and denominators can get very large, even if one always reduces fractions to lowest terms with the Euclidean Algorithm.作者: KIN 時(shí)間: 2025-3-24 21:59
Computing with Errors,not only when inputting data (the number 0.1, for example, has no exact binary representation with finitely many digits; cf. Example?.), but also when using the elementary operations +, ?, ??and ∕. Moreover, the desired answer may be a nonrepresentable number.作者: Psychogenic 時(shí)間: 2025-3-25 02:27
Matchings and Network Flows,networks. It will turn out that the first of these is a special case of the second. Thus it will not come as a surprise that the same basic method, namely augmenting paths, will be the key to solving both.作者: 制造 時(shí)間: 2025-3-25 06:11
Fallstudie AeroLas GmbH: State of the Art,ore all occurring natural numbers in the data type .. This, however, is in fact not the case. A variable of type . usually corresponds to a sequence of 4?bytes. This clearly enables us to represent no more than 2. different numbers. In this chapter we will learn how integers are stored.作者: Granular 時(shí)間: 2025-3-25 09:19
Erfolgskriterien aus Sicht der Bank,e this assumption, although it is clearly by no means a realistic one for arbitrarily large numbers. Here we will investigate how fast one can actually compute with integers. Here, in a narrower sense, elementary operations only include operations and comparisons restricted to integers in some bounded interval.作者: crutch 時(shí)間: 2025-3-25 12:10
https://doi.org/10.1007/978-3-658-21319-0t the occurrence of rounding errors. The elementary operations are, however, comparatively slow because both numerators and denominators can get very large, even if one always reduces fractions to lowest terms with the Euclidean Algorithm.作者: 做事過頭 時(shí)間: 2025-3-25 19:19 作者: 生氣的邊緣 時(shí)間: 2025-3-25 23:25 作者: circuit 時(shí)間: 2025-3-26 04:06 作者: ZEST 時(shí)間: 2025-3-26 08:23
https://doi.org/10.1007/978-3-658-21319-0Numerous discrete structures can best be described using graphs. Furthermore, in countless applications graphs appear naturally. Thus graphs can well be considered to be the most important structure in discrete mathematics.作者: 帶傷害 時(shí)間: 2025-3-26 08:57
https://doi.org/10.1007/3-540-28994-1We will now go on to introduce some simple graph algorithms. We will begin with the “exploration” of a graph: to discover, for example, which vertices are reachable from a given vertex. The presented algorithms will provide much more information and are used in numerous applications.作者: 護(hù)身符 時(shí)間: 2025-3-26 15:45
https://doi.org/10.1007/3-540-28994-1On many occasions stored data files have to be sorted. There are essentially two reasons for this: on the one hand certain algorithms require that the objects are in a specified order and on the other hand, in a sorted data file with random access one can find individual objects much faster (with binary search, cf. Algorithm 5.2).作者: VEN 時(shí)間: 2025-3-26 20:30
https://doi.org/10.1007/3-540-28994-1In this chapter we will deal with the problem of solving systems of linear equations. These take the form . (or more briefly .?=?.), where . and . are given and one wishes to determine .. In other words, one wishes to solve the following numerical computational problem:作者: TRUST 時(shí)間: 2025-3-26 21:00
Introduction,In this chapter we will define a number of basic concepts and present several simple algorithms which we will analyze and implement in C++. We will also see that not everything is computable.作者: ineptitude 時(shí)間: 2025-3-27 01:54
Graphs,Numerous discrete structures can best be described using graphs. Furthermore, in countless applications graphs appear naturally. Thus graphs can well be considered to be the most important structure in discrete mathematics.作者: 精確 時(shí)間: 2025-3-27 06:08 作者: incarcerate 時(shí)間: 2025-3-27 11:32 作者: IRS 時(shí)間: 2025-3-27 16:39 作者: nominal 時(shí)間: 2025-3-27 21:06
subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years..978-3-319-39558-6作者: 榮幸 時(shí)間: 2025-3-27 22:39
Representations of the Integers,ore all occurring natural numbers in the data type .. This, however, is in fact not the case. A variable of type . usually corresponds to a sequence of 4?bytes. This clearly enables us to represent no more than 2. different numbers. In this chapter we will learn how integers are stored.作者: 皺痕 時(shí)間: 2025-3-28 05:01
Computing with Integers,e this assumption, although it is clearly by no means a realistic one for arbitrarily large numbers. Here we will investigate how fast one can actually compute with integers. Here, in a narrower sense, elementary operations only include operations and comparisons restricted to integers in some bound作者: thrombus 時(shí)間: 2025-3-28 06:27 作者: 充氣女 時(shí)間: 2025-3-28 10:34
Computing with Errors,not only when inputting data (the number 0.1, for example, has no exact binary representation with finitely many digits; cf. Example?.), but also when using the elementary operations +, ?, ??and ∕. Moreover, the desired answer may be a nonrepresentable number.作者: 山崩 時(shí)間: 2025-3-28 15:41 作者: obsolete 時(shí)間: 2025-3-28 20:40
Matchings and Network Flows,networks. It will turn out that the first of these is a special case of the second. Thus it will not come as a surprise that the same basic method, namely augmenting paths, will be the key to solving both.作者: COW 時(shí)間: 2025-3-28 23:32
9樓作者: 執(zhí) 時(shí)間: 2025-3-29 04:24
9樓作者: 仔細(xì)閱讀 時(shí)間: 2025-3-29 08:40
9樓作者: pulse-pressure 時(shí)間: 2025-3-29 15:18
10樓作者: 走路左晃右晃 時(shí)間: 2025-3-29 16:03
10樓作者: 哀求 時(shí)間: 2025-3-29 20:45
10樓作者: 兵團(tuán) 時(shí)間: 2025-3-30 00:40
10樓
