Sciweavers

156 search results - page 16 / 32
» On the notion of uniqueness
Sort
View
TAMC
2007
Springer
14 years 3 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
TACS
1994
Springer
14 years 1 months ago
Syntactic Definitions of Undefined: On Defining the Undefined
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
Zena M. Ariola, Richard Kennaway, Jan Willem Klop,...
JACM
2010
120views more  JACM 2010»
13 years 4 months ago
The structure of inverses in schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Alan Nash
SAT
2004
Springer
97views Hardware» more  SAT 2004»
14 years 3 months ago
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
Vasco M. Manquinho, João P. Marques Silva
ECAL
1995
Springer
14 years 1 months ago
Elements of a Theory of Simulation
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
Steen Rasmussen, Christopher L. Barrett