6562 search results - page 288 / 1313 » Noetherianity and Combination Problems |
192
click to vote
SIGMETRICS
2010
ACM
15 years 6 months ago
2010
ACM
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
151
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
193
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
146
click to vote
DATAMINE
2007
15 years 6 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
225
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract—In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether diffe...