MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "A Better than "Best Possible" Algorithm to Edge Color Multigraphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

631,222 documents found, showing 1 through 10. Next 10 →

ATOM

Improving a Family of Approximation Algorithms to Edge Color Multigraphs
by Alberto Caprara, Romeo Rizzi — 1998 — Information Processing Letters
…Improving a Family of Approximation Algorithms to Edge Color Multigraphs Alberto Caprara ?1…
Cited by 7 (0 self) – Add To MetaCart

Improving a Family of Approximation Algorithms to Edge Color Multigraphs
by unknown authors — 1998
… Improving a Family of Approximation Algorithms to Edge Color Multigraphs Alberto Caprara?1…
Add To MetaCart

A Better-Than-Best-Effort Service for Continuous Media UDP
by Flows Mark Parris, Mark Parris, Kevin Jeffay, F. Donelson, Smith Jan Borgersen — in Proceedings of The 8th International Workshop on Networking and Operating System Support for Audio and Video (NOSSDAV’98
…A Better-Than-Best-Effort Service for Continuous Media UDP Flows* Mark Parris Kevin Jeffay F…
Cited by 2 (0 self) – Add To MetaCart

A Better-Than-Best-Effort Service for Continuous Media UDP
by Flows Mark, Mark Parris, Kevin Jeffay, F. Donelson, Smith Jan Borgersen — 1998 — in Proceedings of The 8th International Workshop on Networking and Operating System Support for Audio and Video (NOSSDAV’98
… for Digital Audio and Video, Cambridge, UK, July 1998, to appear. A Better-Than-Best-Effort Service…
Add To MetaCart

Towards a Better-Than-Best-Effort Forwarding Service for Multimedia Flows
by Kevin Jeffay — 1999 — IEEE Multimedia
…Towards a Better-Than-Best-Effort Forwarding Service for Multimedia Flows Kevin Jeffay Department…
Cited by 4 (0 self) – Add To MetaCart

Finding a Better-than-Classical Quantum AND/OR Algorithm using Genetic Programming
by Lee Spector, Herbert J. Bernstein, Howard Barnum, Nikhil Swamy — 1999
… the discovery of a new, better-than-classical quantum algorithm for the depthtwo AND/OR tree problem. We…
Cited by 25 (2 self) – Add To MetaCart

A better-than-greedy approximation algorithm for the minimum set cover problem
by Refael Hassin, Asaf Levin — 2006 — SIAM J. Comput
…A better-than-greedy approximation algorithm for the minimum set cover problem Refael Hassin 1…
Cited by 2 (1 self) – Add To MetaCart

in separate trials, is A better than C?
by Stuart G Baker, Barnett S Kramer, Dr. Carlos Campillo, Hospital Universitario, Son Dureta — 2003
… Correction: The transitive fallacy for randomized trials: If A bests B and B bests C in separate trials, is A…
Add To MetaCart

On Best-Possible Obfuscation
by Shafi Goldwasser, Guy N. Rothblum — 2007 — In TCC
… possible). 6 Definition 2.5 (Best-Possible Obfuscation). An algorithm O that takes as input a circuit in C…
Cited by 2 (0 self) – Add To MetaCart

The Best of All Possible Words
by T. Mark Ellison, Ewan Klein — 2001
… if the target string ends at the edge of a syllable in the input; for example, [pa] is recognized faster than…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB