Sciweavers

1566 search results - page 17 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
ARTCOM
2009
IEEE
14 years 2 months ago
An Efficient Bidirectional Frame Prediction Using Particle Swarm Optimization Technique
—This paper presents a Novel Bidirectional motion estimation technique, which is based on the Particle swarm optimization algorithm. Particle swarm optimization (PSO) is a popula...
D. Ranganadham, Pavan Kumar Gorpuni
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
ICDCS
2000
IEEE
14 years 2 days ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
SIMPRA
1998
99views more  SIMPRA 1998»
13 years 7 months ago
Rollback overhead reduction methods for time warp distributed simulation
Parallel discrete event simulation is a useful technique to improve performance of sequential discrete event simulation. We consider the Time Warp algorithm for asynchronous distr...
Simonetta Balsamo, C. Manconi
ECAI
2006
Springer
13 years 11 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter