2542 search results - page 279 / 509 » Computing Cartograms with Optimal Complexity |
103
Voted
DLT
2003
15 years 1 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
127
click to vote
ICALP
2009
Springer
16 years 24 days ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
110
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
126
Voted
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
86
Voted
MP
2008
15 years 14 days ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...