4438 search results - page 283 / 888 » The Case for Collaborative Programming |
166
click to vote
EMMCVPR
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
170
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
In this work we propose an approach of incorporating learned mutation strategies (LMS) in genetic programming (GP) employed for evolution and adaptation of locomotion gaits of sim...
160
click to vote
POPL
1994
ACM
15 years 10 months ago
1994
ACM
In this paper we present techniques to nd subsets of nodes of a owgraph that satisfy the followingproperty: A test set that exercises all nodes in a subset exercises allnodes in t...
198
click to vote
CF
2005
ACM
15 years 8 months ago
2005
ACM
Exploiting processor groups is becoming increasingly important for programming next-generation high-end systems composed of tens or hundreds of thousands of processors. This paper...
137
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...