Sciweavers

3731 search results - page 132 / 747
» cases 2006
Sort
View
IJFCS
2006
132views more  IJFCS 2006»
15 years 6 months ago
Generalized Lr Parsing Algorithm for Boolean Grammars
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
Alexander Okhotin
IJNSEC
2006
122views more  IJNSEC 2006»
15 years 6 months ago
A Hash-based Strong Password Authentication Protocol with User Anonymity
Password authentication protocols range from complex public-key cryptosystems to simple hash-based password authentication schemes. One common feature of these protocols is that t...
Kumar V. Mangipudi, Rajendra S. Katti
IJUFKS
2006
64views more  IJUFKS 2006»
15 years 6 months ago
Cautious Analysis of Project Risks by Interval-Valued Initial Data
One of the most common performance measures in selection and management of projects is the Net Present Value (NPV). In the paper, we study a case when initial data about the NPV p...
Lev V. Utkin
IMDS
2006
389views more  IMDS 2006»
15 years 6 months ago
Success and failure of pure-play organizations: Webvan versus Peapod, a comparative analysis
Many businesses have failed in pure play markets, on-line grocery retailers or e-grocers among them. E-grocers face many problems which the traditional brick and mortar grocery st...
Stephen E. Lunce, Leslie M. Lunce, Yoko Kawai, Bal...
IPL
2006
118views more  IPL 2006»
15 years 6 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune