3913 search results - page 128 / 783 » complexity 2006 |
APAL
2006
13 years 10 months ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
IJON
2008
13 years 8 months ago
2008
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...
IEEEPACT
2006
IEEE
14 years 4 months ago
2006
IEEE
Modern compiler transformations that eliminate redundant computations or reorder instructions, such as partial redundancy elimination and instruction scheduling, are very effectiv...
CSL
2006
Springer
14 years 1 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...