Sciweavers

223 search results - page 19 / 45
» Proving Termination by Bounded Increase
Sort
View
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
15 years 5 days ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 5 months ago
Dynamics of Profit-Sharing Games
An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study t...
John Augustine, Ning Chen, Edith Elkind, Angelo Fa...
CANS
2008
Springer
111views Cryptology» more  CANS 2008»
14 years 24 days ago
Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
Tiancheng Lou, Christophe Tartary
WDAG
2009
Springer
91views Algorithms» more  WDAG 2009»
14 years 5 months ago
Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
MP
2006
103views more  MP 2006»
13 years 10 months ago
Assessing solution quality in stochastic programs
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
Güzin Bayraksan, David P. Morton