Sciweavers

8540 search results - page 128 / 1708
» The Dynamic Servers Problem
Sort
View
AIMSA
2008
Springer
15 years 22 hour ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
ATMOS
2010
162views Optimization» more  ATMOS 2010»
14 years 8 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
ICDCS
2005
IEEE
15 years 3 months ago
ReDAL: Request Distribution for the Application Layer
Modern application infrastructures are based on clustered, multi-tiered architectures, where request distribution occurs in two sequential stages: over a cluster of web servers, a...
Debra E. VanderMeer, Helen M. Thomas, Kaushik Dutt...
ICDE
1999
IEEE
140views Database» more  ICDE 1999»
15 years 11 months ago
Multiversion Reconciliation for Mobile Databases
As mobile computing devices become more and more popular, mobile databases have started gaining popularity. An important feature of these database systems is their ability to allo...
Shirish Hemant Phatak, B. R. Badrinath
NCA
2009
IEEE
15 years 4 months ago
A Distributed Algorithm for Web Content Replication
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
Sharrukh Zaman, Daniel Grosu