Sciweavers

7943 search results - page 33 / 1589
» A calculus for costed computations
Sort
View
ICCBR
2003
Springer
14 years 18 days ago
Using Case-Based Reasoning to Overcome High Computing Cost Interactive Simulations
Abstract. This paper describes an innovative usage of Case-Based Reasoning to reduce the high computing cost derived from running large interactive simulation scenarios within the ...
Javier Vázquez-Salceda, Miquel Sànch...
IPPS
2005
IEEE
14 years 1 months ago
Job Allocation Schemes in Computational Grids Based on Cost Optimization
In this paper we propose two price-based job allocation schemes for computational grids. A grid system tries to solve problems submitted by various grid users by allocating the jo...
Satish Penmatsa, Anthony T. Chronopoulos
ISCC
2005
IEEE
14 years 1 months ago
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
Yong-Jin Lee, Mohammed Atiquzzaman
ICCNMC
2005
Springer
14 years 28 days ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
CASC
2006
Springer
100views Mathematics» more  CASC 2006»
13 years 11 months ago
Reducing Computational Costs in the Basic Perturbation Lemma
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
Ainhoa Berciano, María José Jim&eacu...