465 search results - page 36 / 93 » On the Hardness of Range Assignment Problems |
114
click to vote
IWMM
2007
Springer
15 years 6 months ago
2007
Springer
Past studies have shown that objects are created and then die in phases. Thus, one way to sustain good garbage collection efficiency is to have a large enough heap to allow many ...
FECS
2006
15 years 1 months ago
2006
Data Communication and Computer Networking is a traditional undergraduate CS course. Classic teaching focuses on communication protocol and algorithm analysis, plus socket programm...
JSA
2000
14 years 11 months ago
2000
In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic e...
101
click to vote
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— People in densely populated environments typically form groups that split and merge. In this paper we track groups of people so as to reflect this formation process an...
GECCO
2008
Springer
15 years 28 days ago
2008
Springer
This paper presents a communication-less multi-agent task allocation procedure that allows agents to use past experience to make non-greedy decisions about task assignments. Exper...