1524 search results - page 146 / 305 » Game Relations and Metrics |
197
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
184
click to vote
TCAD
1998
15 years 6 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
147
click to vote
ICMCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Multimedia is not a dream anymore. Nowadays we use images (e.g., GIF, JPEG, and BMP), videos (e.g., MPEG, AVI, and QuickTime), and sounds (e.g., MIDI and WAV) as well as alphanume...
191
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
176
click to vote
IJCAI
2003
15 years 8 months ago
2003
This paper reports work on automated meta-data creation for multimedia content. The approach results in the generation of a conceptual index of the content which may then be searc...