Sciweavers

3318 search results - page 530 / 664
» The Weak Instance Model
Sort
View
SOFSEM
2000
Springer
14 years 2 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
CP
2008
Springer
14 years 16 days ago
A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
The Cell BE processor provides both scalable computation power and flexibility, and it is already being adopted for many computational intensive applications like aerospace, defens...
Luca Benini, Michele Lombardi, Michela Milano, Mar...
ICALP
2007
Springer
14 years 16 days ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou
ECIR
2007
Springer
14 years 6 days ago
Combining Evidence for Relevance Criteria: A Framework and Experiments in Web Retrieval
Abstract. We present a framework that assesses relevance with respect to several relevance criteria, by combining the query-dependent and query-independent evidence indicating thes...
Theodora Tsikrika, Mounia Lalmas
FAST
2007
14 years 6 days ago
Disk Failures in the Real World: What Does an MTTF of 1, 000, 000 Hours Mean to You?
Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we presen...
Bianca Schroeder, Garth A. Gibson