Sciweavers

ACMSE
2006
ACM
14 years 3 months ago
Yaccscript: a platform for intersecting high-level languages
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....
John Healey
ICALP
2010
Springer
14 years 3 months ago
Scalably Scheduling Power-Heterogeneous Processors
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 ï¬...
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
ICALP
2009
Springer
14 years 3 months ago
Efficient Methods for Selfish Network Design
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...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
ICALP
2009
Springer
14 years 3 months ago
Boundedness of Monadic Second-Order Formulae over Finite Words
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
Achim Blumensath, Martin Otto, Mark Weyer
ICFP
2007
ACM
14 years 3 months ago
Evaluating high-level distributed language constructs
Jan Henry Nyström, Philip W. Trinder, David J...
ICFP
2007
ACM
14 years 3 months ago
Experience report: the reactis validation tool
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...
Steve Sims, Daniel C. DuVarney
ICFP
2007
ACM
14 years 3 months ago
iTasks: executable specifications of interactive work flow systems for the web
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...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
ICALP
2007
Springer
14 years 3 months ago
Online Conflict-Free Colorings for Hypergraphs
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 ...
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olon...