Sciweavers

52 search results - page 7 / 11
» Computing Minimal Diagnoses by Greedy Stochastic Search
Sort
View
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
13 years 5 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
CPHYSICS
2006
204views more  CPHYSICS 2006»
13 years 7 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
BMCBI
2006
129views more  BMCBI 2006»
13 years 7 months ago
BIPAD: A web server for modeling bipartite sequence elements
Background: Many dimeric protein complexes bind cooperatively to families of bipartite nucleic acid sequence elements, which consist of pairs of conserved half-site sequences sepa...
Chengpeng Bi, Peter K. Rogan
EUROPAR
2009
Springer
14 years 2 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga