SAC
1996
ACM
14 years 26 days ago
1996
ACM
SAC
1996
ACM
14 years 26 days ago
1996
ACM
SAC
1996
ACM
14 years 26 days ago
1996
ACM
SAC
1996
ACM
14 years 26 days ago
1996
ACM
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
SAC
1996
ACM
14 years 26 days ago
1996
ACM
SAC
1996
ACM
14 years 26 days ago
1996
ACM
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
SAC
1996
ACM
14 years 26 days ago
1996
ACM
In this paper, we show how genetic algorithms can be used to solve en-route aircraft conflict automatically to increase Air Traffic Control capacity in high density areas. The ATC
ISTCS
1997
Springer
14 years 26 days ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
ISTCS
1997
Springer
14 years 26 days ago
1997
Springer
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no
ISTCS
1997
Springer
14 years 26 days ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...