1986 search results - page 263 / 398 » Path Separability of Graphs |
131
Voted
SAC
2005
ACM
15 years 8 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
135
Voted
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
Whilst tools assist the various tasks required to develop a multi-agent system (MAS), yet there still remains a gap between the generation of MAS models and program code. AUML dev...
113
Voted
WINE
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
107
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
131
click to vote
NOMS
2002
IEEE
15 years 7 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...