2100 search results - page 44 / 420 » Fundamentals of the problem |
EOR
2008
13 years 10 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
CORR
2008
Springer
13 years 10 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...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
IEAAIE
2004
Springer
14 years 3 months ago
2004
Springer
A fundamental difficulty faced by cooperative multiagent systems is to find how to efficiently coordinate agents. There are three fundamental processes to solve the coordination pr...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...