4110 search results - page 33 / 822 » Efficient algorithms for the 2-gathering problem |
134
Voted
AMC
2005
15 years 3 months ago
2005
Financial options whose payoff depends critically on historical prices are called pathdependent options. Their prices are usually harder to calculate than options whose prices do ...
131
Voted
JPDC
2006
15 years 3 months ago
2006
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
151
click to vote
PDPTA
2004
15 years 5 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
137
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
147
Voted
ECCC
2010
15 years 1 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...