3172 search results - page 403 / 635 » On the Random-Self-Reducibility of Complete Sets |
181
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
The biggest obstacle in the formal verification of large designs is their very large state spaces, which cannot be handled even by techniques such as implicit state space travers...
179
click to vote
3DIM
1997
IEEE
15 years 11 months ago
1997
IEEE
In general, multiple views are required to create a complete 3-D model of an object or of a multi-roomed indoor scene. In this work, we address the problem of merging multiple tex...
173
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
178
click to vote
EURONGI
2006
Springer
15 years 10 months ago
2006
Springer
We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. In general, our aim is to study the performance as perceived by users in a dynamic...
169
click to vote
EWCBR
2006
Springer
15 years 10 months ago
2006
Springer
The present paper describes a case-based reasoning solution for solving the task of selecting adequate templates for realizing messages describing actions in a given domain. This s...