Sciweavers

1277 search results - page 15 / 256
» Terminating Decision Algorithms Optimally
Sort
View
SIGCOMM
1995
ACM
15 years 6 months ago
A Mobile User Location Update and Paging Mechanism Under Delay Constraints
A mobile user location management mechanism is introduced that incorporates a distance based location update scheme and a paging mechanism that satis es prede ned delay requiremen...
Ian F. Akyildiz, Joseph S. M. Ho
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
15 years 7 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
16 years 3 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
171
Voted
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
15 years 6 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
129
Voted
AAAI
2004
15 years 4 months ago
Regrets Only! Online Stochastic Optimization under Time Constraints
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
Russell Bent, Pascal Van Hentenryck