900 search results - page 138 / 180 » On Polynomial Time Computation over Unordered Structures |
141
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
156
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
138
click to vote
LCTRTS
2010
Springer
15 years 10 months ago
2010
Springer
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
134
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
139
click to vote
ISSTA
2000
ACM
15 years 7 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...