Sciweavers

4066 search results - page 124 / 814
» Almost Complete Sets
Sort
View
IJIS
2000
75views more  IJIS 2000»
15 years 6 months ago
Relating decision under uncertainty and multicriteria decision making models
This short overview paper points out the striking similarity between decision under uncertainty and multicriteria decision making problems, two areas which have been developed in ...
Didier Dubois, Michel Grabisch, François Mo...
JCSS
1998
74views more  JCSS 1998»
15 years 6 months ago
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
Manindra Agrawal, Eric Allender, Steven Rudich
CCGRID
2006
IEEE
16 years 13 days ago
Towards Soft Real-Time Applications on Enterprise Desktop Grids
— Desktop grids use the idle cycles of desktop PC’s to provide huge computational power at low cost. However, because the underlying desktop computing resources are volatile, a...
Derrick Kondo, Bruno Kindarji, Gilles Fedak, Franc...
DFT
2006
IEEE
130views VLSI» more  DFT 2006»
16 years 13 days ago
Off-Chip Control Flow Checking of On-Chip Processor-Cache Instruction Stream
Control flow checking (CFC) is a well known concurrent checking technique for ensuring that a program’s instruction execution sequence follows permissible paths. Almost all CFC...
Federico Rota, Shantanu Dutt, Sahithi Krishna
TIT
2008
72views more  TIT 2008»
15 years 6 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski