Sciweavers

959 search results - page 47 / 192
» New Techniques for Algorithm Portfolio Design
Sort
View
ICALP
2005
Springer
15 years 5 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
DAC
2012
ACM
13 years 2 months ago
Statistical design and optimization for adaptive post-silicon tuning of MEMS filters
Large-scale process variations can significantly limit the practical utility of microelectro-mechanical systems (MEMS) for RF (radio frequency) applications. In this paper we desc...
Fa Wang, Gokce Keskin, Andrew Phelps, Jonathan Rot...
DASFAA
2010
IEEE
139views Database» more  DASFAA 2010»
15 years 6 months ago
Highly Scalable Multiprocessing Algorithms for Preference-Based Database Retrieval
Abstract. Until recently algorithms continuously gained free performance improvements due to ever increasing processor speeds. Unfortunately, this development has reached its limit...
Joachim Selke, Christoph Lofi, Wolf-Tilo Balke
ICTAI
1997
IEEE
15 years 3 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
WOSP
2005
ACM
15 years 5 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills