Sciweavers

2488 search results - page 285 / 498
» Distributed Non-binary Constraints
Sort
View
IWCMC
2006
ACM
16 years 12 days ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
ATAL
2003
Springer
15 years 11 months ago
Coalition formation with uncertain heterogeneous information
Coalition formation methods allow agents to join together and are thus necessary in cases where tasks can only be performed cooperatively by groups. This is the case in the Reques...
Sarit Kraus, Onn Shehory, Gilad Taase
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 10 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
VLDB
2000
ACM
129views Database» more  VLDB 2000»
15 years 10 months ago
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
Chris Olston, Jennifer Widom
192
Voted
INFOCOM
2005
IEEE
16 years 1 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...