Sciweavers

8094 search results - page 154 / 1619
» Improvements in Formula Generalization
Sort
View
ATAL
2006
Springer
14 years 1 months ago
Model checking knowledge, strategies, and games in multi-agent systems
We present an OBDD-based methodology for verifying time, knowledge, and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we invest...
Alessio Lomuscio, Franco Raimondi
ECAI
2006
Springer
14 years 29 days ago
Elaborating Domain Descriptions
Abstract. In this work we address the problem of elaborating domain descriptions (alias action theories), in particular those that are expressed in dynamic logic. We define a gener...
Andreas Herzig, Laurent Perrussel, Ivan José...
APPROX
2010
Springer
120views Algorithms» more  APPROX 2010»
13 years 10 months ago
Uniform Derandomization from Pathetic Lower Bounds
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
Eric Allender, Vikraman Arvind, Fengming Wang
IPCO
2007
81views Optimization» more  IPCO 2007»
13 years 10 months ago
Matching Problems in Polymatroids Without Double Circuits
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
Márton Makai, Gyula Pap, Jácint Szab...
GLOBECOM
2008
IEEE
13 years 10 months ago
Fluid-Based Modeling of TCP Veno
— This paper makes use of the fluid-based approach to model the throughput of TCP Veno flow over wired/wireless networks. A generalized formula is derived between Veno’s thro...
Ke Zhang, Cheng Peng Fu, Chuan Heng Foh, Maode Ma,...