Sciweavers

673 search results - page 95 / 135
» Biometric random number generators
Sort
View
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
13 years 12 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
ICWN
2008
13 years 9 months ago
A Framework of Authentic Post-Issuance Program Modification for Multi-Application Smart Cards
Authentic program modification is very important for a multi-application smart card system since applications in the system are realized after the issuance of the smart card. In t...
Mohammad Mesbah Uddin, Salahuddin Muhammad Salim Z...
AAAI
1994
13 years 9 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
EOR
2007
75views more  EOR 2007»
13 years 7 months ago
Improved modeling and solution methods for the multi-resource routing problem
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model ro...
Peter Francis, Guangming Zhang, Karen R. Smilowitz
PVLDB
2010
120views more  PVLDB 2010»
13 years 6 months ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab