3991 search results - page 108 / 799 » Bounding homogeneous models |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
CPAIOR
2007
Springer
14 years 2 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
ICONIP
2004
13 years 9 months ago
2004
Abstract. This paper presents a neural-evolutionary framework for the simulation of market models in a bounded rationality scenario. Each agent involved in the scenario make use of...
FUIN
2010
13 years 5 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
TIT
2010
13 years 2 months ago
2010
For adversarial but computationally bounded models of error, we construct appealingly simple and efficient cryptographic encoding and unique decoding schemes whose error-correctio...