986 search results - page 130 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
149
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
154
click to vote
CCCG
2007
15 years 5 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
143
click to vote
ECRTS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
145
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
134
click to vote
IJAIT
2007
15 years 3 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...