Sciweavers

100 search results - page 18 / 20
» sat 2005
Sort
View
ATAL
2005
Springer
14 years 7 days ago
Bounded model checking knowledge and branching time in synchronous multi-agent systems
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
Xiangyu Luo, Kaile Su, Abdul Sattar, Qingliang Che...
ICMCS
2005
IEEE
101views Multimedia» more  ICMCS 2005»
14 years 8 days ago
Speech-adaptive layered G.729 coder for loss concealments of real-time voice over IP
In this paper, we propose a speech-adaptive layered-coding (LC) scheme for the loss concealments of real-time CELPcoded speech transmitted over IP networks. Based on the ITU G.729...
Batu Sat, Benjamin W. Wah
DAC
2005
ACM
14 years 7 months ago
FPGA technology mapping: a study of optimality
This paper attempts to quantify the optimality of FPGA technology mapping algorithms. We develop an algorithm, based on Boolean satisfiability (SAT), that is able to map a small s...
Andrew C. Ling, Deshanand P. Singh, Stephen Dean B...
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
14 years 3 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
DATE
2005
IEEE
106views Hardware» more  DATE 2005»
14 years 9 days ago
SAT-Based Complete Don't-Care Computation for Network Optimization
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
Alan Mishchenko, Robert K. Brayton