Sciweavers

2715 search results - page 287 / 543
» An Implementation of Narrowing Strategies
Sort
View
DAC
1994
ACM
15 years 10 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
FIWAC
1993
139views Cryptology» more  FIWAC 1993»
15 years 10 months ago
Montgomery-Suitable Cryptosystems
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
David Naccache, David M'Raïhi
VLDB
1994
ACM
99views Database» more  VLDB 1994»
15 years 10 months ago
A Low-Cost Storage Server for Movie on Demand Databases
With recent advances in storage and network technology it is now possible to provide movie on demand (MOD) service, eliminating the inflexibility inherent in todays broadcast cabl...
Banu Özden, Alexandros Biliris, Rajeev Rastog...
143
Voted
ALP
1990
Springer
15 years 10 months ago
Equation Solving in Conditional AC-Theories
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
Nachum Dershowitz, Subrata Mitra, G. Sivakumar
ICML
1990
IEEE
15 years 10 months ago
Explanations of Empirically Derived Reactive Plans
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...
Diana F. Gordon, John J. Grefenstette