4743 search results - page 89 / 949 » The PlusCal Algorithm Language |
120
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
116
click to vote
ICALP
1998
Springer
15 years 6 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
151
click to vote
IWMM
1998
Springer
15 years 6 months ago
1998
Springer
Mark and sweep garbage collectors (GC) are classical but still very efficient automatic memory management systems. Although challenged by other kinds of systems, such as copying c...
101
click to vote
ICALP
2000
Springer
15 years 5 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
109
Voted
ASPLOS
1991
ACM
15 years 5 months ago
1991
ACM
Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorith...