10608 search results - page 492 / 2122 » Complexity of O'Hara's Algorithm |
142
Voted
TON
2008
15 years 5 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
178
click to vote
CGO
2011
IEEE
14 years 8 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
138
Voted
DAC
2005
ACM
16 years 6 months ago
2005
ACM
Channel estimation and multiuser detection are enabling technologies for future generations of wireless applications. However, sophisticated algorithms are required for accurate c...
144
click to vote
SPAA
2009
ACM
15 years 12 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
136
Voted
SPAA
2010
ACM
15 years 10 months ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...