16790 search results - page 3109 / 3358 » A Future for Software Engineering |
149
Voted
FSTTCS
2007
Springer
16 years 7 days ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
174
click to vote
FSTTCS
2007
Springer
16 years 7 days ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
147
click to vote
FSTTCS
2007
Springer
16 years 7 days ago
2007
Springer
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...
139
click to vote
FSTTCS
2007
Springer
16 years 7 days ago
2007
Springer
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...
133
click to vote
FSTTCS
2007
Springer
16 years 7 days ago
2007
Springer
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...