Sciweavers

492 search results - page 9 / 99
» The number of possibilities for random dating
Sort
View
IPL
2010
93views more  IPL 2010»
13 years 6 months ago
Randomized algorithms for online bounded bidding
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
Leah Epstein, Asaf Levin
INFOCOM
2003
IEEE
14 years 22 days ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
DATE
2007
IEEE
84views Hardware» more  DATE 2007»
14 years 1 months ago
On test generation by input cube avoidance
Test generation procedures attempt to assign values to the inputs of a circuit so as to detect target faults. We study a complementary view whereby the goal is to identify values ...
Irith Pomeranz, Sudhakar M. Reddy
DATE
2005
IEEE
107views Hardware» more  DATE 2005»
14 years 1 months ago
On Statistical Timing Analysis with Inter- and Intra-Die Variations
In this paper, we highlight a fast, effective and practical statistical approach that deals with inter and intra-die variations in VLSI chips. Our methodology is applied to a numb...
Hratch Mangassarian, Mohab Anis
DATE
2004
IEEE
123views Hardware» more  DATE 2004»
13 years 11 months ago
On Concurrent Error Detection with Bounded Latency in FSMs
We discuss the problem of concurrent error detection (CED) with bounded latency in finite state machines (FSMs). The objective of this approach is to reduce the overhead of CED, a...
Sobeeh Almukhaizim, Petros Drineas, Yiorgos Makris