Sciweavers

1989 search results - page 262 / 398
» Set functions for functional logic programming
Sort
View
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
16 years 18 days ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
ICCAD
2001
IEEE
108views Hardware» more  ICCAD 2001»
16 years 3 days ago
Single-Pass Redundancy Addition and Removal
Redundancy-addition-and-removal is a rewiring technique which for a given target wire wt finds a redundant alternative wire wa. Addition of wa makes wt redundant and hence removab...
Chih-Wei Jim Chang, Malgorzata Marek-Sadowska
WCRE
2008
IEEE
15 years 9 months ago
A Business Process Explorer: Recovering Business Processes from Business Applications
A business process contains a set of logically related tasks executed to fulfill business goals. Business applications enable organizations to automatically perform their daily op...
Jin Guo, Ying Zou
IPPS
2006
IEEE
15 years 9 months ago
An overview of the Jahob analysis system: project goals and current status
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
Viktor Kuncak, Martin C. Rinard
WSE
2005
IEEE
15 years 8 months ago
Modernizing JavaServer Pages by Transformation
One way to improve the maintainability of a web application is to separate its presentation from the business logic. Such separation not only makes a web application easier to evo...
Shannon Xu, Thomas R. Dean