200 search results - page 21 / 40 » ipl 2006 |
IPL
2002
14 years 9 months ago
2002
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
IPL
2002
14 years 9 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
IPL
2002
14 years 9 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
IPL
1998
14 years 9 months ago
1998
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
IPL
2010
14 years 8 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...