13603 search results - page 394 / 2721 » On the Computational Complexity of Cut-Reduction |
152
click to vote
ISMVL
2005
IEEE
16 years 1 months ago
2005
IEEE
In digital signal processing, we often use higher radix system to achieve high-speed computation. In such cases, we require radix converters. This paper considers the design of LU...
159
click to vote
DSD
2002
IEEE
16 years 17 days ago
2002
IEEE
We use a formal tool to extract Finite State Machines (FSM) based representations (lists of states and transitions) of sequential circuits described by flip-flops and gates. The...
228
click to vote
STOC
2005
ACM
16 years 8 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
220
click to vote
ISAAC
2009
Springer
16 years 2 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
198
click to vote
AAAI
2007
15 years 10 months ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...