Sciweavers

250 search results - page 45 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 1 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
ATAL
2005
Springer
15 years 3 months ago
Modeling opponent decision in repeated one-shot negotiations
In many negotiation and bargaining scenarios, a particular agent may need to interact repeatedly with another agent. Typically, these interactions take place under incomplete info...
Sabyasachi Saha, Anish Biswas, Sandip Sen
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
15 years 3 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
TACAS
1998
Springer
98views Algorithms» more  TACAS 1998»
15 years 1 months ago
Efficient Modeling of Memory Arrays in Symbolic Ternary Simulation
This paper enables symbolic ternary simulation of systems with large embedded memories. Each memory array is replaced with a behavioral model, where the number of symbolic variable...
Miroslav N. Velev, Randal E. Bryant
INFOCOM
1999
IEEE
15 years 1 months ago
Scalable Flow Control for Multicast ABR Services
We propose a flow-control scheme for multicast ABR services in ATM networks. At the heart of the proposed scheme is an optimal secondorder rate control algorithm, called the -contr...
Xi Zhang, Kang G. Shin, Debanjan Saha, Dilip D. Ka...