Sciweavers

261 search results - page 37 / 53
» SAT-Based Algorithms for Logic Minimization
Sort
View
SIGMOD
2005
ACM
108views Database» more  SIGMOD 2005»
15 years 3 months ago
A high-performance, transactional filestore for application servers
There is a class of data, including messages and business workflow state, for which conventional monolithic databases are less than ideal. Performance and scalability of Applicati...
Bill Gallagher, Dean Jacobs, Anno Langen
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 2 months ago
A clustering- and probability-based approach for time-multiplexed FPGA partitioning
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity ...
Mango Chia-Tso Chao, Guang-Ming Wu, Iris Hui-Ru Ji...
IJCAI
2001
14 years 11 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
CEE
2010
97views more  CEE 2010»
14 years 8 months ago
A novel implementation of radix-4 floating-point division/square-root using comparison multiples
A new implementation for minimally redundant radix-4 floating-point SRT division/square-root (division/sqrt) with the recurrence in the signed-digit format is introduced. The imp...
Hooman Nikmehr, Braden Phillips, Cheng-Chew Lim
TIME
2009
IEEE
15 years 4 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger