Sciweavers

8496 search results - page 329 / 1700
» Problem Solving and Complex Systems
Sort
View
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
NCA
2007
IEEE
15 years 6 months ago
Safety management of complex technology
One of the key success factors behind the human species is the ability to think, plan and pursue goals. Apart from wisdom and tacit knowledge, experience and awareness of the phys...
Ali G. Hessami
AIPS
1996
15 years 8 months ago
TRAINS-95: Towards a Mixed-Initiative Planning Assistant
We have been examining mixed-initiative planning systems in the context of command and control or logistical overview situations. In such environments, the human and the computer ...
George Ferguson, James F. Allen, Bradford W. Mille...
LCPC
2005
Springer
16 years 5 days ago
Manipulating MAXLIVE for Spill-Free Register Allocation
Abstract. Many embedded systems use single-chip microcontrollers which have no on-chip RAM. In such a system, the processor registers must hold all live data values. Nanocontroller...
Shashi Deepa Arcot, Henry G. Dietz, Sarojini Priya...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 4 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker