Sciweavers

2588 search results - page 219 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
SOFSEM
2012
Springer
14 years 2 months ago
Recent Challenges and Ideas in Temporal Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
Orna Kupferman
DAC
2004
ACM
16 years 7 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf
CHI
2005
ACM
16 years 7 months ago
Automatic generation of high coverage usability tests
Software systems are often complex in the number of features that are available through the user interface and consequently, the number of interactions that can occur. Such system...
Renée C. Bryce
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
16 years 5 days ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
SIGECOM
2003
ACM
119views ECommerce» more  SIGECOM 2003»
15 years 12 months ago
Preference elicitation in proxied multiattribute auctions
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
Aditya V. Sunderam, David C. Parkes