18306 search results - page 373 / 3662 » Algorithmics in Exponential Time |
186
click to vote
ICSM
2005
IEEE
16 years 14 days ago
2005
IEEE
Large-scale legacy programs take long time to compile, thereby hampering productivity. This paper presents algorithms that reduce compilation time by analyzing syntactic dependenc...
134
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present a timing optimization algorithm based on the concept of gate duplication on the technologydecomposed network. We first examine the relationship between gate duplication...
151
click to vote
TACAS
1999
Springer
15 years 11 months ago
1999
Springer
We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state change...
153
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
164
click to vote
APLAS
2009
ACM
15 years 11 months ago
2009
ACM
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...