Sciweavers

666 search results - page 120 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
AOSD
2008
ACM
13 years 11 months ago
Tool-supported refactoring of aspect-oriented programs
Aspect-oriented programming languages provide new composition mechanisms for improving the modularity of crosscutting concerns. Implementations of such language support use advanc...
Jan Wloka, Robert Hirschfeld, Joachim Hänsel
BIB
2008
86views more  BIB 2008»
13 years 9 months ago
Recent developments in the MAFFT multiple sequence alignment program
The accuracy and scalability of multiple sequence alignment (MSA) of DNAs and proteins have long been and are still important issues in bioinformatics. To rapidly construct a reas...
Kazutaka Katoh, Hiroyuki Toh
POPL
2006
ACM
14 years 9 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
SIGMETRICS
2008
ACM
138views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Utility maximization in peer-to-peer systems
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Ji...
DAC
2005
ACM
14 years 10 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu