Sciweavers

777 search results - page 88 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
13 years 12 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He
ICC
1997
IEEE
159views Communications» more  ICC 1997»
13 years 12 months ago
Collision Avoidance and Resolution Multiple Access: First-Success Protocols
Abstract—Collision avoidance and resolution multiple access (CARMA) protocols establish a three-way handshake between sender and receiver to attempt to avoid collisions, and reso...
Rodrigo Garcés, J. J. Garcia-Luna-Aceves
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
13 years 11 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
AAAI
1996
13 years 9 months ago
Goal Oriented Symbolic Propagation in Bayesian Networks
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
Enrique Castillo, José Manuel Gutiér...
CSR
2007
Springer
14 years 1 months ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...