1074 search results - page 79 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Parallel load balancing is studied for problems with certain bisection properties. A class of problems has bisectors if every problem p of weight wp in the class can be subdivided...
COLT
1995
Springer
15 years 1 months ago
1995
Springer
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
COLT
2000
Springer
15 years 2 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
101
click to vote
ISORC
1999
IEEE
15 years 2 months ago
1999
IEEE
To analyze the complexity of object-oriented software, several metrics have been proposed. Among them, Chidamber and Kemerer's metrics are well-known ones as object-oriented ...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...