5105 search results - page 61 / 1021 » An algorithm to determine peer-reviewers |
142
Voted
OL
2011
14 years 7 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
88
Voted
JCIT
2010
14 years 7 months ago
2010
In the trilateration of wireless sensor networks, to overcome the affection of localization error caused by the selection of beacon nodes, a selective strategy of beacon nodes bas...
119
Voted
SIGGRAPH
1993
ACM
15 years 4 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
109
Voted
WINET
2010
14 years 10 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
131
click to vote
ALGORITHMICA
2011
14 years 4 months ago
2011
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...