Sciweavers

1144 search results - page 199 / 229
» Logic programming for combinatorial problems
Sort
View
CP
2003
Springer
14 years 27 days ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
SPIN
2001
Springer
14 years 3 days ago
p2b: A Translation Utility for Linking Promela and Symbolic Model Checking (Tool Paper)
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
Michael Baldamus, Jochen Schröder-Babo
EUROMICRO
1999
IEEE
13 years 12 months ago
Enhancing Security in the Memory Management Unit
We propose an hardware solution to several security problems that are difficult to solve on classical processor architectures, like licensing, electronic commerce, or software pri...
Tanguy Gilmont, Jean-Didier Legat, Jean-Jacques Qu...
LOPSTR
1998
Springer
13 years 12 months ago
Improving Homeomorphic Embedding for Online Termination
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
Michael Leuschel
ICCAD
1996
IEEE
92views Hardware» more  ICCAD 1996»
13 years 12 months ago
Generation of BDDs from hardware algorithm descriptions
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
Shin-ichi Minato