10585 search results - page 1972 / 2117 » The Orc Programming Language |
92
Voted
CP
2003
Springer
15 years 5 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
CSL
2003
Springer
15 years 5 months ago
2003
Springer
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
101
click to vote
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
101
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
95
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...