Sciweavers

424 search results - page 60 / 85
» Realizability models and implicit complexity
Sort
View
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 8 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
FC
2007
Springer
111views Cryptology» more  FC 2007»
14 years 2 months ago
A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting
A multi-coupon (MC) represents a collection of k coupons that a user can redeem to a vendor in exchange for some goods or services. Nguyen (FC 2006), deepening the ideas of Chen et...
Liqun Chen, Alberto N. Escalante, Hans Löhr, ...
IFIP
2007
Springer
14 years 2 months ago
Global Supply Chain Control
The operation of global manufacturing network is challenging due to the complexity in product and information flow, diversity in sites, localization and processes and the informati...
Heidi C. Dreyer, Ottar Bakås, Erlend Alfnes,...
DATE
2000
IEEE
140views Hardware» more  DATE 2000»
14 years 1 months ago
Resolution of Dynamic Memory Allocation and Pointers for the Behavioral Synthesis from C
-- One of the greatest challenges in C/C++-based design methodology is to efficiently map C/C++ models into hardware. Many of the networking and multimedia applications implemente...
Luc Séméria, Koichi Sato, Giovanni D...
AAAI
2007
13 years 11 months ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt