Sciweavers

1452 search results - page 60 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
118
Voted
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
15 years 5 months ago
A Hybrid Approach to Discover Bayesian Networks From Databases Using Evolutionary Programming
This paper describes a novel data mining approach that employs evolutionary programming to discover knowledge represented in Bayesian networks. There are two different approaches ...
Man Leung Wong, Shing Yan Lee, Kwong-Sak Leung
POPL
2004
ACM
15 years 6 months ago
Summarizing procedures in concurrent programs
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
101
Voted
LPNMR
1997
Springer
15 years 4 months ago
Improving the Alternating Fixpoint: The Transformation Approach
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
Ulrich Zukowski, Burkhard Freitag, Stefan Brass
76
Voted
JSS
2007
123views more  JSS 2007»
15 years 12 days ago
Do programmer pairs make different mistakes than solo programmers?
Objective: Comparison of program defects caused by programmer pairs and solo developers. Design: Analysis of programs developed during two counter balanced experiments. Setting: P...
Matthias M. Müller
96
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 24 days ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl