Sciweavers

14 search results - page 1 / 3
» On Linear Time Minor Tests and Depth First Search
Sort
View
WADS
1989
Springer
63views Algorithms» more  WADS 1989»
13 years 9 months ago
On Linear Time Minor Tests and Depth First Search
Hans L. Bodlaender
KI
2006
Springer
13 years 5 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
DDECS
2007
IEEE
175views Hardware» more  DDECS 2007»
13 years 12 months ago
Analyzing Test and Repair Times for 2D Integrated Memory Built-in Test and Repair
—An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. A commonly used repair strategy is to equip memories with sp...
Philipp Öhler, Sybille Hellebrand, Hans-Joach...
AAAI
1996
13 years 7 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
ELPUB
2007
ACM
13 years 9 months ago
Designing Metadata Surrogates for Search Result Interfaces of Learning Object Repositories: Linear versus Clustered Metadata Des
This study reports the findings of a usability test conducted to examine users' interaction with two different learning object metadata-driven search result interfaces. The f...
Panos Balatsoukas, Anne Morris, Ann O'Brien