874 search results - page 77 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
142
click to vote
NIPS
2007
15 years 5 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
161
click to vote
ANCS
2008
ACM
15 years 6 months ago
2008
ACM
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
142
click to vote
ECRTS
2006
IEEE
15 years 10 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
167
click to vote
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
156
Voted
TCOM
2010
15 years 2 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....