W3C home > Mailing lists > Public > public-webrtc@w3.org > September 2013

Re: gUM's optional constraints algorithm penalizes user-choice chasing best-match for webpage

From: Martin Thomson <martin.thomson@gmail.com>
Date: Sat, 31 Aug 2013 22:06:39 -0700
Message-ID: <CABkgnnUS1jPkwKFSoGbYQx6bn9NvbEzppRFN8DNK+=jcPJBG0g@mail.gmail.com>
To: Jan-Ivar Bruaroey <jib@mozilla.com>
Cc: "public-webrtc@w3.org" <public-webrtc@w3.org>
On 31 August 2013 12:12, Jan-Ivar Bruaroey <jib@mozilla.com> wrote:
> We could make further changes but I worry it wont generalize to all
> constraints the way this relatively minor change does.

Your proposal is somewhat less efficient, if that's the concern.  I
was thinking that each "miss" would bump the source down a category,
so that you get all the sources that meet all criteria, then the
sources that meet all bar one criterion, then the sources that meet
all bar two, and so forth.

Simple to implement, no two-pass processing, not a big change.  Thoughts?
Received on Sunday, 1 September 2013 05:07:06 UTC

This archive was generated by hypermail 2.3.1 : Monday, 23 October 2017 15:19:35 UTC