1002 search results - page 97 / 201 » Towards Graph Programs for Graph Algorithms |
171
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
114
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
148
Voted
NIPS
2004
15 years 4 months ago
2004
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...
117
Voted
ICPP
1994
IEEE
15 years 6 months ago
1994
IEEE
1 In this paper, we explore the problem of scheduling parallel programs using task duplication for messagepassing multicomputers. Task duplication means scheduling a parallel progr...
139
Voted
JMLR
2010
15 years 1 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...