作者: IST 時(shí)間: 2025-3-21 20:33
Gerth St?lting Brodal,Daniele Frigioni,Alberto MarIncludes supplementary material: 作者: GRUEL 時(shí)間: 2025-3-22 03:19 作者: 世俗 時(shí)間: 2025-3-22 08:01
https://doi.org/10.1007/3-540-44688-5algorithm engineering; algorithms; data structures; discrete algorithms; experimental algorithmics; netwo作者: angiography 時(shí)間: 2025-3-22 09:54
978-3-540-42500-7Springer-Verlag Berlin Heidelberg 2001作者: 無辜 時(shí)間: 2025-3-22 12:59
https://doi.org/10.1007/978-3-030-88124-5tomaton (NFA) construction algorithm, we are able to encode the DFA using (.+ 1)(2. + |Σ|) bits, where . is the number of characters (excluding operator symbols) in the regular expression and Σ is the alphabet. This compares favorably against the worst case of (. + 1)2.|Σ| bits needed by a classical作者: Introduction 時(shí)間: 2025-3-22 18:59
https://doi.org/10.1007/978-981-16-4979-0differences. The program . is a simple and practical bit-vector algorithm for this problem. In this paper we consider the following incremental version of the problem: given an appropriate encoding of a comparison between . and ., can one compute the answer for . and ., and the answer for . and . wi作者: Adherent 時(shí)間: 2025-3-22 22:33
Interstellar Medium Scale I: Galaxy Size,d predictable locality at all levels of the memory hierarchy, with no . knowledge of the specific memory system organization for any particular machine. By both simulations and execution on a number of platforms, we show that memory hierarchies portability does not sacrifice floating point performan作者: bacteria 時(shí)間: 2025-3-23 04:42
El?bieta Go?ata,Bernadette Jondaockwise-allocated pile (a heap without the order property). The data structure is easily explainable provided that one knows the classical heap concept. All core deque operations are performed in .(1) worst-case time. Also, general modifying operations are provided which run in .(√.) time if the str作者: 使顯得不重要 時(shí)間: 2025-3-23 07:23
https://doi.org/10.1007/978-3-531-90911-0as plane graphs and planar maps, polyhedral surfaces and boundary representations (BREPs), two-dimensional views of a three dimensional scene, etc. Many variants have been proposed in the literature, starting with the winged-edge data structure of Baumgart[.], the DCEL of [.,.], the quad-edge data s作者: 圓錐 時(shí)間: 2025-3-23 10:48
https://doi.org/10.1007/978-3-531-90911-0 for the dynamic predecessor problem: to maintain a set . of keys from a totally ordered universe under insertions, deletions and predecessor queries. We give two general techniques for simultaneously reducing cache and TLB misses: simulating 3-level hierarchical memory algorithms and cache-obliviou作者: anesthesia 時(shí)間: 2025-3-23 14:18 作者: hemorrhage 時(shí)間: 2025-3-23 21:55
El?bieta Go?ata,Bernadette Jondaon version of) this problem can be solved efficiently if the objective functions are concave, the general problem of resource allocation with functions that are not necessarily concave is difficult. In this paper we show that for a large class of problem instances with noisy objective functions the 作者: CROAK 時(shí)間: 2025-3-24 00:59
Wolfgang Lutz,Gustav Feichtingerat a set of clients can be supplied by them at the minimum cost. This problem often appears as a subproblem in other combinatorial problems. Several branch and bound techniques have been developed to solve this problem. In this paper we present some techniques that enhance the performance of branch 作者: 自戀 時(shí)間: 2025-3-24 04:28
https://doi.org/10.1007/978-3-663-09576-7n this paper, we show that this algorithm can be modified to run much faster if there is some kind of imbalance in satisfying assignments and we have a (partial) knowledge about that. Especially if a satisfying assignment has imbalanced 0’s and 1’s, i.e., ... 1’s and (1 – ..). 0’s, then we can find 作者: hemorrhage 時(shí)間: 2025-3-24 08:09 作者: Accrue 時(shí)間: 2025-3-24 14:26 作者: Microaneurysm 時(shí)間: 2025-3-24 15:39
,Alterung der Bev?lkerung und Innovation,mobile users, the ., that moves in a predetermined way is used as an intermediate pool for receiving and delivering messages. Under this approach, we present a new semi-compulsory protocol called the . in which the members of ∑ perform concurrent and continuous random walks and exchange any informat作者: Radiation 時(shí)間: 2025-3-24 22:10 作者: intertwine 時(shí)間: 2025-3-25 00:59 作者: acclimate 時(shí)間: 2025-3-25 06:33 作者: 高度 時(shí)間: 2025-3-25 07:44 作者: APO 時(shí)間: 2025-3-25 12:02
https://doi.org/10.1007/978-3-322-92312-7n four types of . that are likely to occur in a deregulated marketplace. Our results show that the networks that are adequate in a regulated marketplace might be inadequate for satisfying all the bilateral contracts in a deregulated industry.作者: 能得到 時(shí)間: 2025-3-25 18:06 作者: yohimbine 時(shí)間: 2025-3-25 21:36 作者: 木訥 時(shí)間: 2025-3-26 02:27 作者: investigate 時(shí)間: 2025-3-26 08:22 作者: 撫育 時(shí)間: 2025-3-26 08:38 作者: compose 時(shí)間: 2025-3-26 16:11
https://doi.org/10.1007/978-3-531-90911-0ny variants have been proposed in the literature, starting with the winged-edge data structure of Baumgart[.], the DCEL of [.,.], the quad-edge data structure [.], the halfedge data structure [.,., and refs. therein]. They have been proposed in various frameworks (references too many to give here):作者: SOB 時(shí)間: 2025-3-26 19:59
Katarzyna Kopycka M.A.,Maria Reinhold M.A.C++, having special emphasis on adaptability, extensibility and efficiency. We achieve these goals following the generic programming paradigm and using templates as our tools. These ideas are realized and tested in C. [.], the Computational Geometry Algorithms Library.作者: 發(fā)誓放棄 時(shí)間: 2025-3-26 23:56 作者: subacute 時(shí)間: 2025-3-27 04:34
An Adaptable and Extensible Geometry Kernel,C++, having special emphasis on adaptability, extensibility and efficiency. We achieve these goals following the generic programming paradigm and using templates as our tools. These ideas are realized and tested in C. [.], the Computational Geometry Algorithms Library.作者: 充氣女 時(shí)間: 2025-3-27 08:27 作者: Stricture 時(shí)間: 2025-3-27 12:42 作者: 符合你規(guī)定 時(shí)間: 2025-3-27 13:44 作者: Herpetologist 時(shí)間: 2025-3-27 19:40
https://doi.org/10.1007/978-3-531-90911-0s algorithms. We give preliminary experimental results which demonstrate that data structures based on these ideas outperform data structures which are based on minimising cache misses alone, namely B-tree variants.作者: Dappled 時(shí)間: 2025-3-28 00:43 作者: Mendicant 時(shí)間: 2025-3-28 05:00
Wolfgang Lutz,Gustav Feichtingerand bound algorithms. Computational experiments show that the new algorithms thus obtained generate less than 60% of the number of subproblems generated by branch and bound algorithms, and in certain cases require less than 10% of the execution times required by conventional branch and bound algorithms.作者: Monocle 時(shí)間: 2025-3-28 07:28
https://doi.org/10.1007/978-3-663-09576-7a solution in time 1.260. when p. = 1/3 and 1.072. when p. = 0.1. Such an imbalance often exists in SAT instances reduced from other combinatorial problems. As a concrete example, we investigate a reduction from 3DM and show our new approach is nontrivially faster than its direct algorithms. Preliminary experimental results are also given.作者: Pert敏捷 時(shí)間: 2025-3-28 12:14 作者: 大喘氣 時(shí)間: 2025-3-28 15:08
,Alterung der Bev?lkerung und Innovation, been carried out in a new generic framework that we developed to implement protocols for mobile computing. Our experiments showed that for both protocols only a small support is required for efficient communication, and that the runners protocol outperforms the snake protocol in almost all types of inputs we considered.作者: Desert 時(shí)間: 2025-3-28 20:52
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks, been carried out in a new generic framework that we developed to implement protocols for mobile computing. Our experiments showed that for both protocols only a small support is required for efficient communication, and that the runners protocol outperforms the snake protocol in almost all types of inputs we considered.作者: 欲望 時(shí)間: 2025-3-28 23:34 作者: 嬉耍 時(shí)間: 2025-3-29 06:35
Experiences with the Design and Implementation of Space-Efficient Deques,ucture contains . elements. Experiences with an implementation of the data structure show that, compared to an existing library implementation, the constants for some of the operations are unfavourably high, whereas others show improved running times.作者: Granular 時(shí)間: 2025-3-29 08:15
Optimised Predecessor Data Structures for Internal Memory,s algorithms. We give preliminary experimental results which demonstrate that data structures based on these ideas outperform data structures which are based on minimising cache misses alone, namely B-tree variants.作者: 清楚 時(shí)間: 2025-3-29 13:13
Efficient Resource Allocation with Noisy Functions,optimal solutions can be computed efficiently. We support our claims by experimental evidence. Our experiments show that our algorithm in hard and practically relevant cases runs up to 40 – 60 times faster than the standard method.作者: Cleave 時(shí)間: 2025-3-29 17:13 作者: 大約冬季 時(shí)間: 2025-3-29 20:23
Exploiting Partial Knowledge of Satisfying Assignments,a solution in time 1.260. when p. = 1/3 and 1.072. when p. = 0.1. Such an imbalance often exists in SAT instances reduced from other combinatorial problems. As a concrete example, we investigate a reduction from 3DM and show our new approach is nontrivially faster than its direct algorithms. Preliminary experimental results are also given.作者: 品嘗你的人 時(shí)間: 2025-3-30 01:22
An Experimental Study of Data Migration Algorithms,ce of these new algorithms against similar algorithms from Hall et al. [.] which have better theoretical guarantees and find that in almost all cases, the new algorithms perform better. We also find that both the new algorithms and the ones from Hall et al. perform much better in practice than the theoretical bounds suggest.作者: 多嘴多舌 時(shí)間: 2025-3-30 04:31
0302-9743 rical research on algorithms and data structures; and methodological issues regarding the process of converting user requirements into efficient algorithmic solutions and implemenations.978-3-540-42500-7978-3-540-44688-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: PHON 時(shí)間: 2025-3-30 08:43
Compact DFA Representation for Fast Regular Expression Search,tomaton (NFA) construction algorithm, we are able to encode the DFA using (.+ 1)(2. + |Σ|) bits, where . is the number of characters (excluding operator symbols) in the regular expression and Σ is the alphabet. This compares favorably against the worst case of (. + 1)2.|Σ| bits needed by a classical作者: 動(dòng)物 時(shí)間: 2025-3-30 14:48 作者: 愚蠢人 時(shí)間: 2025-3-30 17:03
