Sciweavers

1146 search results - page 138 / 230
» Finite cupping sets
Sort
View
SIGSOFT
2000
ACM
15 years 10 months ago
Automating first-order relational logic
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
Daniel Jackson
IFIP
1998
Springer
15 years 10 months ago
One Sided Error Predicates in Geometric Computing
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicate...
Lutz Kettner, Emo Welzl
DATE
1997
IEEE
99views Hardware» more  DATE 1997»
15 years 10 months ago
Fast controllers for data dominated applications
A target structure for implementing fast edge-triggered control units is presented. In many cases, the proposed controller is faster than a one-hot encoded structure as its correc...
Andre Hertwig, Hans-Joachim Wunderlich
INFOCOM
1997
IEEE
15 years 10 months ago
Secret Sharing in Graph-Based Prohibited Structures
A secret sharing schemefor the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsetsof ...
Hung-Min Sun, Shiuh-Pyng Shieh
ICTAI
1996
IEEE
15 years 10 months ago
Applying a Mutation-based Genetic Algorithm to Processor Configuration Problems
The Processor Configuration Problem (PCP) is a Constraint Optimization Problem. The task is to link up a finite set of processors into a network, while minimizing the maximum dist...
T. L. Lau, Edward P. K. Tsang