Sciweavers

1381 search results - page 130 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
ICCD
2006
IEEE
148views Hardware» more  ICCD 2006»
16 years 1 months ago
Trends and Future Directions in Nano Structure Based Computing and Fabrication
— As silicon CMOS devices are scaled down into the nanoscale regime, new challenges at both the device and system level are arising. While some of these challenges will be overco...
R. Iris Bahar
ATAL
2009
Springer
15 years 11 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
MIAR
2010
IEEE
15 years 2 months ago
Computational Decision Support for Percutaneous Aortic Valve Implantation
Valve replacement is the most common therapy for diseased aortic valves. Percutaneous approaches are becoming increasingly popular, due to reduced procedural complications and lowe...
Ingmar Voigt, Razvan Ioan Ionasec, Bogdan Georgesc...
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
16 years 5 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
SAT
2005
Springer
129views Hardware» more  SAT 2005»
15 years 10 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah