1399 search results - page 112 / 280 » New Algorithms for k-Center and Extensions |
TOOLS
2000
IEEE
14 years 1 months ago
2000
IEEE
— In Java, method implementations are chosen at runtime by late-binding with respect to the runtime class of just the receiver argument. However, in order to simplify many progra...
ICPP
1998
IEEE
14 years 1 months ago
1998
IEEE
Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper ...
DLT
2003
13 years 10 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
WSC
2004
13 years 10 months ago
2004
Existing research has defined a new type of simulation time called Approximate Time, where the simulation's knowledge about the values that represent time is uncertain. The a...
COMBINATORICS
2004
13 years 9 months ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...