Sciweavers

1583 search results - page 193 / 317
» Continuous Optimization
Sort
View
103
Voted
CSJM
2006
76views more  CSJM 2006»
15 years 3 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
127
Voted
MP
2008
99views more  MP 2008»
15 years 3 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
107
Voted
CEE
2005
92views more  CEE 2005»
15 years 3 months ago
An adaptive call admission algorithm for cellular networks
In this paper, we first propose a new continuous action-set learning automaton and theoretically study its convergence properties and show that it converges to the optimal action....
Hamid Beigy, Mohammad Reza Meybodi
134
Voted
CSUR
1999
114views more  CSUR 1999»
15 years 3 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
138
Voted
JSS
1998
90views more  JSS 1998»
15 years 3 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp