Sciweavers

16504 search results - page 256 / 3301
» New Problems, New Solutions
Sort
View
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
15 years 1 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto
IPL
2011
96views more  IPL 2011»
15 years 1 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay
IACR
2011
113views more  IACR 2011»
14 years 6 months ago
GNUC: A New Universal Composability Framework
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
Dennis Hofheinz, Victor Shoup
APNOMS
2009
Springer
15 years 4 months ago
Network Partitioning and Self-sizing Methods for QoS Management with Autonomic Characteristics
The inherent and increasing complexity, heterogeneity and unpredictability of computer networks make the task of managing these systems highly complex. The autonomic computing para...
Romildo Martins da Silva Bezerra, Joberto Sé...
AAAI
2006
15 years 8 months ago
Locally Optimal Algorithms and Solutions for Distributed Constraint Optimization
This paper summarizes the author's recent work in distributed constraint optimization (DCOP). New local algorithms, as well as theoretical results about the types of solution...
Jonathan P. Pearce