118
click to vote
FCT
15 years 4 months ago
2007 Springer 
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
102
click to vote
FCT
15 years 4 months ago
2007 Springer 
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
FCT
15 years 6 months ago
2007 Springer 
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
113
click to vote
FCT
15 years 1 months ago
2007 Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
FCT
15 years 6 months ago
2007 Springer
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
|
Applied Computing