Sciweavers

2354 search results - page 421 / 471
» Randomness, Stochasticity and Approximations
Sort
View
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
14 years 2 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
STOC
1997
ACM
126views Algorithms» more  STOC 1997»
14 years 2 months ago
Page Replacement with Multi-Size Pages and Applications to Web Caching
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
Sandy Irani
ALT
1997
Springer
14 years 2 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar
EPIA
1997
Springer
14 years 2 months ago
GenSAT: A Navigational Approach
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
Yury V. Smirnov, Manuela M. Veloso
COCOA
2009
Springer
14 years 2 months ago
Positive Influence Dominating Set in Online Social Networks
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
Feng Wang 0002, Erika Camacho, Kuai Xu