26354 search results - page 359 / 5271 » How we refactor, and how we know it |
190
click to vote
GI
2009
Springer
15 years 11 months ago
2009
Springer
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
169
click to vote
EUROGP
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes how animat-based “food foraging” techniques may be applied to the design of low-level image processing algorithms. First, we show how we implemented the fo...
148
click to vote
PODC
1999
ACM
15 years 11 months ago
1999
ACM
Various timing-based mutualexclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorith...
251
click to vote
ICNP
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper we give a general definition of weighted fairness and discuss how a pricing policy can be mapped to general weighted (GW) fairness. The GW fairness can be achieved b...
169
click to vote
ICSE
1994
IEEE-ACM
15 years 11 months ago
1994
IEEE-ACM
As software systems become more complex the overall system structure { or software architecture { becomes a central design problem. An important step towards an engineering discip...