Sciweavers

21 search results - page 4 / 5
» Test suite reduction and prioritization with call trees
Sort
View
ACL
1993
13 years 6 months ago
Towards History-Based Grammars: Using Richer Models for Probabilistic Parsing
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
Ezra Black, Frederick Jelinek, John D. Lafferty, D...
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
13 years 11 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
WCRE
2003
IEEE
13 years 10 months ago
GUI Ripping: Reverse Engineering of Graphical User Interfaces for Testing
Graphical user interfaces (GUIs) are important parts of today’s software and their correct execution is required to ensure the correctness of the overall software. A popular tec...
Atif M. Memon, Ishan Banerjee, Adithya Nagarajan
SIGSOFT
2006
ACM
14 years 6 months ago
Failure proximity: a fault localization-based approach
Recent software systems usually feature an automated failure reporting system, with which a huge number of failing traces are collected every day. In order to prioritize fault dia...
Chao Liu 0001, Jiawei Han
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 6 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...