Sciweavers

6 search results - page 1 / 2
» Handling Large Search Space in Pattern-Based Reverse Enginee...
Sort
View
IWPC
2003
IEEE
13 years 10 months ago
Handling Large Search Space in Pattern-Based Reverse Engineering
Large industrial legacy systems are challenges of reverseengineering activities. Reverse-engineering approaches use text-search tools based on regular expressions or work on prese...
Jörg Niere, Jörg P. Wadsack, Lothar Wend...
ER
2005
Springer
200views Database» more  ER 2005»
13 years 10 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
PUK
2000
13 years 6 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp
CORR
2011
Springer
181views Education» more  CORR 2011»
12 years 11 months ago
Compressed String Dictionaries
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel...
C3S2E
2010
ACM
13 years 5 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire