Sciweavers

7978 search results - page 1209 / 1596
» Combining shared-coin algorithms
Sort
View
ICWS
2009
IEEE
16 years 4 months ago
Integrating Behavioral Trust in Web Service Compositions
Algorithms for composing Web services (WS) traditionally utilize the functional and quality-of-service parameters of candidate services to decide which services to include in the ...
Sharon Paradesi, Prashant Doshi, Sonu Swaika
FOIKS
2008
Springer
16 years 3 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
16 years 3 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov
ICCAD
2007
IEEE
143views Hardware» more  ICCAD 2007»
16 years 3 months ago
TIP-OPC: a new topological invariant paradigm for pixel based optical proximity correction
—As the 193nm lithography is likely to be used for 45nm and even 32nm processes, much more stringent requirement will be posed on Optical Proximity Correction (OPC) technologies....
Peng Yu, David Z. Pan
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
16 years 3 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
« Prev « First page 1209 / 1596 Last » Next »