86 search results - page 11 / 18 » A Classical Realizability Model for a Semantical Value Restr... |
78
Voted
SEMWEB
2007
Springer
15 years 3 months ago
2007
Springer
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
FUIN
2006
14 years 9 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
COGSR
2010
14 years 4 months ago
2010
We propose a formalization of C.G. Jung's theory of personality using a four-dimensional Hilbert-space for the representation of two qubits. The first qubit relates to Jung&#...
EPIA
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
EOR
2006
14 years 9 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...