Sciweavers

1542 search results - page 281 / 309
» The metamathematics of random graphs
Sort
View
EUROCRYPT
2005
Springer
14 years 2 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
ICDCIT
2005
Springer
14 years 2 months ago
Self-stabilizing Deterministic TDMA for Sensor Networks
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...
Mahesh Arumugam, Sandeep S. Kulkarni
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 2 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
14 years 2 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
KR
2004
Springer
14 years 2 months ago
GAI Networks for Utility Elicitation
This paper deals with preference representation and elicitation in the context of multiattribute utility theory under risk. Assuming the decision maker behaves according to the EU...
Christophe Gonzales, Patrice Perny