1632 search results - page 117 / 327 » Sublinear Time Algorithms for Metric Space Problems |
145
click to vote
ICESS
2004
Springer
15 years 9 months ago
2004
Springer
Real-time transaction processing becomes concerns as embedded time coming rapidly. However, the transaction process in real-time embedded system still has some problems in resource...
150
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
132
Voted
CN
2008
15 years 3 months ago
2008
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
152
click to vote
TCS
2010
15 years 2 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
121
click to vote
MUE
2007
IEEE
15 years 10 months ago
2007
IEEE
Swarm Intelligence (SI) inspired routing algorithms have become a research focus in recent years due to their self-organizing nature, which is very suitable to the routing problem...