Sciweavers

15951 search results - page 2930 / 3191
» Lawful software engineering
Sort
View
FSTTCS
2007
Springer
15 years 10 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
FSTTCS
2007
Springer
15 years 10 months ago
Closures and Modules Within Linear Logic Concurrent Constraint Programming
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
Rémy Haemmerlé, François Fage...
FSTTCS
2007
Springer
15 years 10 months ago
A Theory for Game Theories
Abstract. We explain a double-category (of positions and plays) attached to the theory of HOgames (those with the so-called switching condition [7]) from which the category of aren...
Michel Hirschowitz, André Hirschowitz, Tom ...
FSTTCS
2007
Springer
15 years 10 months ago
Solving Parity Games in Big Steps
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
Sven Schewe
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 10 months ago
Search-based testing of service level agreements
The diffusion of service oriented architectures introduces the need for novel testing approaches. On the one side, testing must be able to identify failures in the functionality ...
Massimiliano Di Penta, Gerardo Canfora, Gianpiero ...
« Prev « First page 2930 / 3191 Last » Next »