Sciweavers

174 search results - page 29 / 35
» Practically Perfect
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 22 days ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
ETFA
2008
IEEE
14 years 3 months ago
Pinpointing interrupts in embedded real-time systems using context checksums
When trying to track down bugs using cyclic debugging, the ability to correctly reproduce executions is imperative. In sequential, deterministic, non-real-time software, this repr...
Daniel Sundmark, Henrik Thane
ICICS
2003
Springer
14 years 1 months ago
ID-Based Distributed "Magic Ink" Signature from Pairings
The advantage of ID-based system is the simplification of key distribution and certification management; a user can directly use his identity as his public key instead of an arbi...
Yan Xie, Fangguo Zhang, Xiaofeng Chen, Kwangjo Kim
DAC
2004
ACM
14 years 9 months ago
Virtual memory window for application-specific reconfigurable coprocessors
Reconfigurable Systems-on-Chip (SoCs) on the market consist of full-fledged processors and large Field-Programmable Gate-Arrays (FPGAs). The latter can be used to implement the sy...
Miljan Vuletic, Laura Pozzi, Paolo Ienne
WWW
2007
ACM
14 years 9 months ago
XML design for relational storage
Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently. Several normal forms, generalizing those for relational databa...
Solmaz Kolahi, Leonid Libkin