Sciweavers

1331 search results - page 236 / 267
» Complexity bounds for zero-test algorithms
Sort
View
ISPD
2004
ACM
161views Hardware» more  ISPD 2004»
14 years 1 months ago
Early-stage power grid analysis for uncertain working modes
High performance integrated circuits are now reaching the 100-plus watt regime, and power delivery and power grid signal integrity have become critical. Analyzing the performance ...
Haifeng Qian, Sani R. Nassif, Sachin S. Sapatnekar
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
ICALP
2004
Springer
14 years 1 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...
FATES
2003
Springer
14 years 27 days ago
Auto-generating Test Sequences Using Model Checkers: A Case Study
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These approaches leverage the witness (or counter-example) ...
Mats Per Erik Heimdahl, Sanjai Rayadurgam, Willem ...
FGR
2000
IEEE
159views Biometrics» more  FGR 2000»
14 years 3 days ago
Segmenting Hands of Arbitrary Color
Colorhasbeen widelyused for handsegmentation. However, many approaches rely on predefined skin color models. It is very difficult to predefine a color model in a mobile applica...
Xiaojin Zhu, Jie Yang, Alex Waibel