Sciweavers

4432 search results - page 585 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
16 years 6 days ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
163
Voted
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
15 years 10 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
129
Voted
AFRICACRYPT
2010
Springer
15 years 10 months ago
ECC2K-130 on Cell CPUs
This paper describes an implementation of Pollard’s rho algorithm to compute the elliptic curve discrete logarithm for the Synergistic Processor Elements of the Cell Broadband En...
Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhage...
ICC
2009
IEEE
150views Communications» more  ICC 2009»
15 years 10 months ago
Optimum Internet Gateway Selection in Ad Hoc Networks
—Wireless ad hoc networks are connected to the fixed Internet by means of Internet gateways. Whenever a node within the ad hoc network wishes to communicate with a host in the I...
Felix Hoffmann, Daniel Medina
ISCC
2009
IEEE
129views Communications» more  ISCC 2009»
15 years 10 months ago
Handling dynamics in gossip-based aggregation schemes
A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple ...
Nicola Bicocchi, Marco Mamei, Franco Zambonelli