Sciweavers

2925 search results - page 515 / 585
» Information Complexity of Online Problems
Sort
View
KI
2009
Springer
14 years 4 months ago
Planning with h +  in Theory and Practice
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
Christoph Betz, Malte Helmert
SACRYPT
2009
Springer
130views Cryptology» more  SACRYPT 2009»
14 years 4 months ago
Format-Preserving Encryption
Format-preserving encryption (FPE) encrypts a plaintext of some specified format into a ciphertext of identical format—for example, encrypting a valid credit-card number into a ...
Mihir Bellare, Thomas Ristenpart, Phillip Rogaway,...
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
SIBGRAPI
2008
IEEE
14 years 4 months ago
Structural Matching of 2D Electrophoresis Gels using Graph Models
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
ISVLSI
2007
IEEE
181views VLSI» more  ISVLSI 2007»
14 years 4 months ago
Code-coverage Based Test Vector Generation for SystemC Designs
Abstract— Time-to-Market plays a central role on System-ona-Chip (SoC) competitiveness and the quality of the final product is a matter of concern as well. As SoCs complexity in...
Alair Dias Jr., Diógenes Cecilio da Silva J...