Sciweavers

3928 search results - page 84 / 786
» order 2006
Sort
View
DAGSTUHL
2006
15 years 5 months ago
The complexity of Boolean functions from cryptographic viewpoint
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
Claude Carlet
IPL
2006
80views more  IPL 2006»
15 years 4 months ago
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
Neal Lesh, Michael Mitzenmacher
JAR
2006
95views more  JAR 2006»
15 years 4 months ago
Mechanizing and Improving Dependency Pairs
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
Jürgen Giesl, René Thiemann, Peter Sch...
RC
2006
87views more  RC 2006»
15 years 4 months ago
Robust Control for Two-Time-Scale Discrete Interval Systems
The problem of designing robust controller for discrete two-time-scale interval systems, conveniently represented using interval matrix notion, is considered. The original full ord...
Balasaheb Patre, Bijnan Bandyopadhyay
RC
1998
92views more  RC 1998»
15 years 3 months ago
When Is the Product of Intervals Also an Interval?
Interval arithmetic is based on the fact that for intervals on the real line, the element-wise product of two intervals is also an interval. This property is not always true: e.g....
Olga Kosheleva, Piet G. Vroegindeweij