1101 search results - page 184 / 221 » Forcing in proof theory |
DAM
2008
13 years 10 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
ECCC
2008
13 years 10 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
ENTCS
2008
13 years 10 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
FUIN
2006
13 years 10 months ago
2006
Traditional Machine Learning approaches based on single inference mechanisms have reached their limits. This causes the need for a framework that integrates approaches based on aba...
FUIN
2006
13 years 10 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...