Sciweavers

3335 search results - page 330 / 667
» Grid result checking
Sort
View
ATAL
2004
Springer
16 years 2 days ago
The Insufficiency of Formal Design Methods - The Necessity of an Experimental Approach - for the Understanding and Control of Co
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
Bruce Edmonds, Joanna Bryson
EVOW
2004
Springer
16 years 2 days ago
Binary Merge Model Representation of the Graph Colouring Problem
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
István Juhos, Attila Tóth, Jano I. v...
170
Voted
SAT
2004
Springer
85views Hardware» more  SAT 2004»
16 years 1 days ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz
CONCUR
2001
Springer
15 years 11 months ago
On the Power of Labels in Transition Systems
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
Jirí Srba
ECP
1999
Springer
157views Robotics» more  ECP 1999»
15 years 11 months ago
SAT-Based Procedures for Temporal Reasoning
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...
Alessandro Armando, Claudio Castellini, Enrico Giu...