APLAS
2004
ACM
14 years 7 months ago
2004
ACM
ACMSE
2006
ACM
14 years 7 months ago
2006
ACM
Programming paradigms are often skewed towards a particular domain of problems, thus one effective way to utilize them is through a multiparadigm approach to software development....
ICALP
2010
Springer
14 years 7 months ago
2010
Springer
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted �...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
Reactis is a commercially successful testing and validation tool which is implemented almost entirely in Standard ML. Our experience using a functional language to develop a comme...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
ICALP
2007
Springer
14 years 7 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...