Sciweavers

3379 search results - page 325 / 676
» Powers of Two
Sort
View
CORR
2002
Springer
144views Education» more  CORR 2002»
15 years 4 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
FGCS
2000
93views more  FGCS 2000»
15 years 4 months ago
Sharing objects in a distributed, single address space environment
With reference to an object type defining the two basic operations, read and write, we present solutions to the object sharing problem, classified according to the migration and/o...
Gianluca Dini, Lanfranco Lopriore
ENTCS
2002
95views more  ENTCS 2002»
15 years 4 months ago
A Proof Dedicated Meta-Language
We describe a proof dedicated meta-language, called Ltac, in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local ...
David Delahaye
LOGCOM
2000
93views more  LOGCOM 2000»
15 years 4 months ago
The product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
Frank Wolter
JOLLI
2002
141views more  JOLLI 2002»
15 years 4 months ago
Naming Worlds in Modal and Temporal Logic
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...
Dov M. Gabbay, G. Malod