1686 search results - page 162 / 338 » Programs as polygraphs: computability and complexity |
127
click to vote
SIGSOFT
2006
ACM
15 years 9 months ago
2006
ACM
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
150
Voted
ASPLOS
1992
ACM
15 years 7 months ago
1992
ACM
Next generation computer systems will have gigabytes of physical memory and processors in the 200 MIPS range or higher. While this trend suggests that memory management for most p...
117
Voted
EMO
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents results of extensive computational experiments in which evolutionary multiobjective algorithms were used to find Pareto-optimal solutions to a complex structura...
139
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
131
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...