Sciweavers

1744 search results - page 187 / 349
» What's There to Talk About
Sort
View
TCS
2008
13 years 10 months ago
On the power of lookahead in on-line server routing problems
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci,...
JSA
2007
89views more  JSA 2007»
13 years 10 months ago
Robust codes and robust, fault-tolerant architectures of the Advanced Encryption Standard
— Hardware implementations of cryptographic algorithms are vulnerable to fault analysis attacks. Methods based on traditional fault-tolerant architectures are not suited for prot...
Konrad J. Kulikowski, Mark G. Karpovsky, Alexander...
CAS
2004
104views more  CAS 2004»
13 years 10 months ago
Why Model?
This lecture treats some enduring misconceptions about modeling. One of these is that the goal is always prediction. The lecture distinguishes between explanation and prediction a...
S. E. van der Leeuw
JLP
2000
134views more  JLP 2000»
13 years 10 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
JSC
2000
117views more  JSC 2000»
13 years 10 months ago
Goals and Benchmarks for Automated Map Reasoning
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...
Andrea Formisano, Eugenio G. Omodeo, Marco Temperi...