3758 search results - page 222 / 752 » A Complete Subsumption Algorithm |
TACAS
1995
Springer
15 years 6 months ago
1995
Springer
HyTech is a tool for the automated analysis of embedded systems. This document, designed for the rst-time user of HyTech, guides the reader through the underlying system model, an...
140
click to vote
CIAC
2010
Springer
15 years 5 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
106
click to vote
ESOP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
120
Voted
ESANN
2007
15 years 3 months ago
2007
We propose a network model of spiking neurons, without preimposed topology and driven by STDP (Spike-Time-Dependent Plasticity), a temporal Hebbian unsupervised learning mode, biol...
132
click to vote
IJCAI
2007
15 years 3 months ago
2007
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...