標(biāo)題: Titlebook: Computational Science and Its Applications - ICCSA 2004; International Confer Antonio Laganá,Marina L. Gavrilova,Osvaldo Gervasi Conference [打印本頁(yè)] 作者: 拼圖游戲 時(shí)間: 2025-3-21 16:31
書目名稱Computational Science and Its Applications - ICCSA 2004影響因子(影響力)
書目名稱Computational Science and Its Applications - ICCSA 2004影響因子(影響力)學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2004網(wǎng)絡(luò)公開度
書目名稱Computational Science and Its Applications - ICCSA 2004網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2004被引頻次
書目名稱Computational Science and Its Applications - ICCSA 2004被引頻次學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2004年度引用
書目名稱Computational Science and Its Applications - ICCSA 2004年度引用學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2004讀者反饋
書目名稱Computational Science and Its Applications - ICCSA 2004讀者反饋學(xué)科排名
作者: SLUMP 時(shí)間: 2025-3-21 22:41 作者: BOON 時(shí)間: 2025-3-22 00:32 作者: Keratin 時(shí)間: 2025-3-22 06:28
https://doi.org/10.1007/978-1-4613-3918-2olving the second-order differential equation. However, this method caused some difficulties in linearizing and approximating the equation and had some restrictions on using various balancing trajectories. The proposed method in this paper is based on the GA (genetic algorithm) for minimizing the mo作者: 感激小女 時(shí)間: 2025-3-22 10:00 作者: invade 時(shí)間: 2025-3-22 16:04 作者: invade 時(shí)間: 2025-3-22 20:14
K. V. Ellis,G. White,A. E. Warn efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. If the parameter we concern is to measure the delay on that link, then the shortest 作者: Aerophagia 時(shí)間: 2025-3-22 23:10 作者: 合適 時(shí)間: 2025-3-23 02:42 作者: 未完成 時(shí)間: 2025-3-23 05:41 作者: 泥瓦匠 時(shí)間: 2025-3-23 13:35
K. V. Ellis,G. White,A. E. Warnr communication. This paper presents the design and experiment of a new communication-aware parallel quicksort scheme for distributed-memory multiprocessor systems. The key idea of the proposed scheme is the . of processors, which enables not only less inter-processor communication but also better l作者: 硬化 時(shí)間: 2025-3-23 16:33 作者: inhumane 時(shí)間: 2025-3-23 20:50 作者: 乳白光 時(shí)間: 2025-3-23 22:12 作者: 勉勵(lì) 時(shí)間: 2025-3-24 04:30
https://doi.org/10.1007/978-94-009-2069-9ing a proxy cache cooperative group. There are times when proxy caches, which are located in the same Internet service provider network, could cooperate between each other, but they do not know of the existence of other caches. In this paper we are proposing a proxy caches auto-configuration protoco作者: abstemious 時(shí)間: 2025-3-24 07:35
Robert V. Goldstein,Gerard A. Mauginss a lot of idle peer-resources such as desktop computers across the Internet, for solving large-scale computing applications. Each peer is autonomous and it needs incentive for sustained contribution of its resources to P2P applications. In addition, a flexible and efficient job scheduling is neede作者: bacteria 時(shí)間: 2025-3-24 13:55
https://doi.org/10.1007/3-211-38065-5d, if some feature values in the branches require high costs to get or are not available. As a method to overcome this difficulty, we applied a multidimensional association rule algorithm with some restriction to the branches of generated decision tree, and found that most of the branches in the dec作者: 吵鬧 時(shí)間: 2025-3-24 17:50 作者: 種植,培養(yǎng) 時(shí)間: 2025-3-24 21:05
What Do Contact Angles Measure?,cess allows rapid dissemination of information to all network nodes. However, the dynamics of epidemic algorithms can be strongly influenced by the network topology. In this paper, numerical simulations are used to illustrate such influences. We address networks with simple topologies for simplicity作者: 疼死我了 時(shí)間: 2025-3-25 01:34 作者: META 時(shí)間: 2025-3-25 06:03
https://doi.org/10.1007/b98054Computer; XML; algorithms; automata; cluster computing; computational mathematics; computational science; c作者: AND 時(shí)間: 2025-3-25 08:38
978-3-540-22060-2Springer-Verlag Berlin Heidelberg 2004作者: Arthr- 時(shí)間: 2025-3-25 15:06 作者: Incumbent 時(shí)間: 2025-3-25 19:17
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232963.jpg作者: 濃縮 時(shí)間: 2025-3-25 20:13
New Techniques in Designing Finite Difference Domain Decomposition Algorithm for the Heat Equation define the finite difference schemes at the interface grid points with smaller time step . (. is a positive integer) by the classical explicit scheme. The stability region of the algorithm is expanded m times comparing with the classical explicit scheme, and the prior error estimates for the numeri作者: 演繹 時(shí)間: 2025-3-26 02:00
A Fast Construction Algorithm for the Incidence Matrices of a Class of Symmetric Balanced Incomplete distributed systems, communication networks, etc. In this paper, an explicit formula for a class of symmetric BIBDs is presented. Based on this formula, an efficient algorithm for constructing the incidence matrix of the design is developed. The incidence matrix contains all essential information o作者: inhumane 時(shí)間: 2025-3-26 07:25 作者: Neolithic 時(shí)間: 2025-3-26 11:48
Optimal Gait Control for a Biped Locomotion Using Genetic Algorithmolving the second-order differential equation. However, this method caused some difficulties in linearizing and approximating the equation and had some restrictions on using various balancing trajectories. The proposed method in this paper is based on the GA (genetic algorithm) for minimizing the mo作者: 使虛弱 時(shí)間: 2025-3-26 14:55 作者: glisten 時(shí)間: 2025-3-26 17:47 作者: UTTER 時(shí)間: 2025-3-27 00:20 作者: Irritate 時(shí)間: 2025-3-27 02:10
A Study on Efficient Key Distribution and Renewal in Broadcast Encryptionetwork. In this broadcast encryption method, only previously authorized users can gain access to digital information. When broadcast message is transmitted, authorized users can first decode the session key using the previously given private key and get digital information using this session key. Th作者: EXCEL 時(shí)間: 2025-3-27 06:16
Self-Tuning Mechanism for Genetic Algorithms Parameters, an Application to Data-Object Allocation inproblem domain and size. This approach differs from the traditional methods which require knowing first the problem domain, and then knowing how to select the parameter values for solving specific problem instances. The proposed method is based on a sample of problem instances, whose solution permit作者: Priapism 時(shí)間: 2025-3-27 11:49 作者: 冥想后 時(shí)間: 2025-3-27 13:40 作者: radiograph 時(shí)間: 2025-3-27 19:07 作者: choleretic 時(shí)間: 2025-3-28 00:38 作者: 步兵 時(shí)間: 2025-3-28 03:21 作者: 等待 時(shí)間: 2025-3-28 08:18
Dynamic Configuration between Proxy Caches within an Intraneting a proxy cache cooperative group. There are times when proxy caches, which are located in the same Internet service provider network, could cooperate between each other, but they do not know of the existence of other caches. In this paper we are proposing a proxy caches auto-configuration protoco作者: padding 時(shí)間: 2025-3-28 13:13 作者: BARB 時(shí)間: 2025-3-28 18:30
Reducing on the Number of Testing Items in the Branches of Decision Treesd, if some feature values in the branches require high costs to get or are not available. As a method to overcome this difficulty, we applied a multidimensional association rule algorithm with some restriction to the branches of generated decision tree, and found that most of the branches in the dec作者: 帽子 時(shí)間: 2025-3-28 20:57
CORBA-Based, Multi-threaded Distributed Simulation of Hierarchical DEVS Models: Transforming Model Sluster, a CORBA-Based, multi-threaded distributed simulation scheme for models specified by the DEVS formalism. The simulator transforms a hierarchical DEVS model into a non-hierarchical one. This transformation can ease the synchronization of the distributed simulation of DEVS models by enabling th作者: 令人不快 時(shí)間: 2025-3-29 01:22
The Effects of Network Topology on Epidemic Algorithmscess allows rapid dissemination of information to all network nodes. However, the dynamics of epidemic algorithms can be strongly influenced by the network topology. In this paper, numerical simulations are used to illustrate such influences. We address networks with simple topologies for simplicity作者: 舊病復(fù)發(fā) 時(shí)間: 2025-3-29 07:05 作者: 漸變 時(shí)間: 2025-3-29 09:10 作者: foreign 時(shí)間: 2025-3-29 12:11 作者: 擁擠前 時(shí)間: 2025-3-29 16:49 作者: 鋪?zhàn)?nbsp; 時(shí)間: 2025-3-29 23:05 作者: 側(cè)面左右 時(shí)間: 2025-3-30 00:30
A Study on Efficient Key Distribution and Renewal in Broadcast Encryptionating users, and; (2) the server and users generate keys by mutual agreement. The advantage of the two proposed methods is that the receiver can decode broadcast message using a secret key. Even if the key is renewed later, the user can efficiently renew using only a single set of information.作者: Glower 時(shí)間: 2025-3-30 04:35
Self-Tuning Mechanism for Genetic Algorithms Parameters, an Application to Data-Object Allocation ineter values of the Genetic Algorithm for a given instance is possible, and that this mechanism yields satisfactory results in quality and execution time. We consider that the proposed method principles can be extended for the self-tuning of control parameters for other heuristic algorithms.作者: somnambulism 時(shí)間: 2025-3-30 11:13
A Market-Based Scheduler for JXTA-Based Peer-to-Peer Computing Systemuler follows a hierarchy scheme. The design allows multiple consumers and multiple providers to schedule and run jobs. To allow wider support for a wide variety of applications, the system is designed to allow easy ‘plug in’ of user applications.作者: coagulate 時(shí)間: 2025-3-30 15:26
Computational Science and Its Applications - ICCSA 2004International Confer作者: PUT 時(shí)間: 2025-3-30 17:02 作者: 坦白 時(shí)間: 2025-3-31 00:19
0302-9743 ligent automata aimed at alleviating the b- den of working out suitable tools for solving complex problems. For this reason ComputationalScience,thoughoriginatingfromtheneedtosolvethemostch- lenging problems in science and engineering (computational science is the key player in the ?ght to gain fund作者: Functional 時(shí)間: 2025-3-31 01:42
Surface Modification for Improved Properties. The stability region of the algorithm is expanded m times comparing with the classical explicit scheme, and the prior error estimates for the numerical solutions are obtained for some algorithms when .=2 or .=3. Numerical experiments on stability and accuracy are also presented.作者: 付出 時(shí)間: 2025-3-31 08:19 作者: BURSA 時(shí)間: 2025-3-31 12:09 作者: 基因組 時(shí)間: 2025-3-31 13:37 作者: anaerobic 時(shí)間: 2025-3-31 21:07 作者: Optometrist 時(shí)間: 2025-4-1 00:43
New Techniques in Designing Finite Difference Domain Decomposition Algorithm for the Heat Equation. The stability region of the algorithm is expanded m times comparing with the classical explicit scheme, and the prior error estimates for the numerical solutions are obtained for some algorithms when .=2 or .=3. Numerical experiments on stability and accuracy are also presented.作者: 追逐 時(shí)間: 2025-4-1 04:56
A Fast Construction Algorithm for the Incidence Matrices of a Class of Symmetric Balanced Incompletela, an efficient algorithm for constructing the incidence matrix of the design is developed. The incidence matrix contains all essential information of the design. The computational costs of the algorithm are .(.) which are superior to those of .(..) or . by the conventional methods, where . is the number of objects or blocks.作者: RLS898 時(shí)間: 2025-4-1 09:05
ILUTP_Mem: A Space-Efficient Incomplete LU Preconditionersubsequently applied iterative solver converge more rapidly. This paper describes ILUTP_Mem, an incomplete LU preconditioner that computes an incomplete LU factorization that effectively uses an amount of space specified by the user. The ILUTP_Mem preconditioner is evaluated on a set of matrices from real applications.作者: hallow 時(shí)間: 2025-4-1 11:37 作者: Inordinate 時(shí)間: 2025-4-1 15:14
The Effects of Network Topology on Epidemic Algorithmstwork topology. In this paper, numerical simulations are used to illustrate such influences. We address networks with simple topologies for simplicity and in order to isolate other effects that occur in more complex networks.
