Sciweavers

793 search results - page 108 / 159
» Input Modeling Tools for Complex Problems
Sort
View
FSTTCS
2009
Springer
15 years 6 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
MFCS
2010
Springer
14 years 10 months ago
Proof Systems and Transformation Games
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
Yoram Bachrach, Michael Zuckerman, Michael Wooldri...
ICWS
2009
IEEE
14 years 9 months ago
Discovery of Optimized Web Service Configurations Using a Hybrid Semantic and Statistical Approach
We present a Semantic Optimized Service Discovery (SemOSD) approach capable of handling Web service search requests on a fine-grained level of detail where we augment semantic ser...
Maciej Zaremba, Jacek Migdal, Manfred Hauswirth
IPPS
2006
IEEE
15 years 5 months ago
Sim-X: parallel system software for interactive multi-experiment computational studies
Advances in high-performance computing have led to the broad use of computational studies in everyday engineering and scientific applications. A single study may require thousand...
Siu-Man Yau, Eitan Grinspun, Vijay Karamcheti, Den...
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
15 years 1 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek