Sciweavers

2487 search results - page 462 / 498
» Partitions of Graphs into Trees
Sort
View
KCAP
2005
ACM
14 years 1 months ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
SAC
2005
ACM
14 years 1 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
CIKM
2005
Springer
14 years 1 months ago
Interconnection semantics for keyword search in XML
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...
Sara Cohen, Yaron Kanza, Benny Kimelfeld, Yehoshua...
RE
2005
Springer
14 years 1 months ago
Reverse Engineering Goal Models from Legacy Code
A reverse engineering process aims at reconstructing el abstractions from source code. This paper presents a novel reverse engineering methodology for recovering stakeholder goal ...
Yijun Yu, Yiqiao Wang, John Mylopoulos, Sotirios L...
AMAI
2004
Springer
14 years 1 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate