Sciweavers

5084 search results - page 191 / 1017
» Proving Possibility Properties
Sort
View
IWPEC
2004
Springer
15 years 11 months ago
Parameterized Graph Separation Problems
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
Dániel Marx
SAT
2004
Springer
111views Hardware» more  SAT 2004»
15 years 11 months ago
A Note on Satisfying Truth-Value Assignments of Boolean Formulas
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
Zbigniew Stachniak
CEC
2003
IEEE
15 years 11 months ago
A new particle swarm optimiser for linearly constrained optimisation
A new PSO algorithm, the Linear PSO (LPSO), is developed to optimise functions constrained by linear constraints of the form Ax = b. A crucial property of the LPSO is that the poss...
Ulrich Paquet, Andries Petrus Engelbrecht
FSTTCS
1999
Springer
15 years 10 months ago
Explicit Substitutions and Programming Languages
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
Jean-Jacques Lévy, Luc Maranget
EVOW
2004
Springer
15 years 10 months ago
Hardness Prediction for the University Course Timetabling Problem
This paper presents an attempt to find a statistical model that predicts the hardness of the University Course Timetabling Problem by analyzing instance properties. The model may l...
Philipp Kostuch, Krzysztof Socha