Sciweavers

3359 search results - page 67 / 672
» A Simplified Idea Algorithm
Sort
View
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
14 years 2 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
SIGSOFT
2004
ACM
14 years 10 months ago
System architecture: the context for scenario-based model synthesis
Constructing rigorous models for analysing the behaviour of concurrent and distributed systems is a complex task. Our aim is to facilitate model construction. Scenarios provide si...
Jeff Kramer, Jeff Magee, Robert Chatley, Sebasti&a...
CSCW
2000
ACM
14 years 2 months ago
Copies convergence in a distributed real-time collaborative environment
In real−time collaborative systems, replicated objects, shared by users, are subject to concurrency constraints. In order to satisfy these, various algorithms, qualified as opâˆ...
Nicolas Vidot, Michèle Cart, Jean Ferri&eac...
WD
2010
13 years 8 months ago
Self-organized aggregation in irregular wireless networks
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...
Joanna Geibig, Dirk Bradler
IPCO
2001
166views Optimization» more  IPCO 2001»
13 years 11 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....