Sciweavers

1071 search results - page 157 / 215
» Solving Geometric Constraint Systems
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad
ICS
2005
Tsinghua U.
15 years 3 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
JAIR
2006
179views more  JAIR 2006»
14 years 9 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
15 years 1 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
CONEXT
2010
ACM
14 years 7 months ago
Optimal content placement for a large-scale VoD system
IPTV service providers offering Video-on-Demandcurrently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes...
David Applegate, Aaron Archer, Vijay Gopalakrishna...