The Experts below are selected from a list of 1725 Experts worldwide ranked by ideXlab platform

Richard A Epstein - One of the best experts on this subject based on the ideXlab platform.

  • supreme court brief of dr ananda Chakrabarty as amicus curiae in support of petitioners in bilski
    Social Science Research Network, 2009
    Co-Authors: Scott F Kieff, Richard A Epstein
    Abstract:

    The Court should reject the Federal Circuit’s new, restrictive approach to patent eligibility because it is in conflict with the statute, the precedents of this Court, and sound public policy. The Federal Circuit’s narrow interpretation of patent eligibility strikes first at excluding patents in the area of business methods and software, in direct conflict with the Court’s decision in Diehr. Worse still, the Federal Circuit’s approach could easily cast a pall over all method claims in other areas of technology. Given the long established links between the eligibility rules for software and biotech, it is likely to spread its tentacles to biotech in particular, thereby undermining the huge boost that the Court’s decision in Chakrabarty gave to bioscience. Furthermore, the Federal Circuit’s approach will have a profound adverse effect on the public’s ability to benefit from Dr. Chakrabarty’s own research.

Julia Powles - One of the best experts on this subject based on the ideXlab platform.

Marten Maack - One of the best experts on this subject based on the ideXlab platform.

  • estimating the makespan of the two valued restricted assignment problem
    Algorithmica, 2018
    Co-Authors: Klaus Jansen, Kati Land, Marten Maack
    Abstract:

    We consider a special case of the scheduling problem on unrelated machines, namely the restricted assignment problem with two different processing times. We show that the configuration LP has an integrality gap of at most  $$\frac{5}{3} \approx 1.667$$ for this problem. This allows us to estimate the optimal makespan within a factor of  $$\frac{5}{3}$$ , improving upon the previously best known estimation algorithm with ratio  $$\frac{11}{6} \approx 1.833$$ due to Chakrabarty et al. (in: Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms (SODA 2015), pp 1087–1101, 2015).

  • estimating the makespan of the two valued restricted assignment problem
    Scandinavian Workshop on Algorithm Theory, 2016
    Co-Authors: Klaus Jansen, Kati Land, Marten Maack
    Abstract:

    We consider a special case of the scheduling problem on unrelated machines, namely the Restricted Assignment Problem with two different processing times. We show that the configuration LP has an integrality gap of at most 5/3 ~ 1.667 for this problem. This allows us to estimate the optimal makespan within a factor of 5/3, improving upon the previously best known estimation algorithm with ratio 11/6 ~ 1.833 due to Chakrabarty, Khanna, and Li.

Klaus Jansen - One of the best experts on this subject based on the ideXlab platform.

  • estimating the makespan of the two valued restricted assignment problem
    Algorithmica, 2018
    Co-Authors: Klaus Jansen, Kati Land, Marten Maack
    Abstract:

    We consider a special case of the scheduling problem on unrelated machines, namely the restricted assignment problem with two different processing times. We show that the configuration LP has an integrality gap of at most  $$\frac{5}{3} \approx 1.667$$ for this problem. This allows us to estimate the optimal makespan within a factor of  $$\frac{5}{3}$$ , improving upon the previously best known estimation algorithm with ratio  $$\frac{11}{6} \approx 1.833$$ due to Chakrabarty et al. (in: Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms (SODA 2015), pp 1087–1101, 2015).

  • estimating the makespan of the two valued restricted assignment problem
    Scandinavian Workshop on Algorithm Theory, 2016
    Co-Authors: Klaus Jansen, Kati Land, Marten Maack
    Abstract:

    We consider a special case of the scheduling problem on unrelated machines, namely the Restricted Assignment Problem with two different processing times. We show that the configuration LP has an integrality gap of at most 5/3 ~ 1.667 for this problem. This allows us to estimate the optimal makespan within a factor of 5/3, improving upon the previously best known estimation algorithm with ratio 11/6 ~ 1.833 due to Chakrabarty, Khanna, and Li.

Tranier, José Alberto - One of the best experts on this subject based on the ideXlab platform.

  • Preguntas para el futuro sobre las lecciones de hoy: una conversación con Dipesh Chakrabarty
    Universidad Nacional de Mar del Plata, 2021
    Co-Authors: Yedaide, María Marta, Tranier, José Alberto
    Abstract:

    En este particular año de COVID, incluso entre los remanentes obstinados de una inicial desesperanza, nos reencontramos con el placer de pensar y conversar juntxs respecto del mundo y lo que deseamos que con/en él (nos) suceda. Aglutinados afectivamente en lo que Pepe Tranier gustó en llamar “Red de Educadorxs periféricxs”, y aprovechando la cancelación del espacio que el aislamiento trajo, decidimos iniciar unos diálogos, unas COVID-saciones desde universidades públicas hermanadas, con grandes referentes de nuestras bibliotecas. Deseábamos que los Memorables del mundo nos ayudaran a repensar los actuales escenarios políticos, sociales, académicos, pedagógicos y culturales en la especial coyuntura que atravesamos. Liberados de los condicionamientos económicos y erotizados por las posibilidades infinitas que se dejan ver en las catástrofes—o tal vez en las mudanzas entre mundos semióticos cuando el camino se vuelve pregunta, como propone Sara Ahmed (2020)—no escatimamos en potencia deseante y contactamos a esas personalidades que admiramos profundamente. Es así como llegamos a Dipesh Chakrabarty, este increíble historiador bengalí, integrante del Grupo de Estudios subalternos y una de las voces más punzantes, aunque profundamente responsables y prudentes, de las perspectivas poscoloniales. No es sencillo hacer justicia al tono cálido y cordial de sus correos en respuesta a nuestra invitación; tal vez sea suficiente decir que el interés por sus producciones académicas finalmente se asentó para nosotros en una vida que le otorgó más coherencia y sentido a lo que habíamos leído. Compartimos aquí, entonces, la conversación que se sucedió en medio de esas grandes expectativas (personales, académicas) y el ánimo celebratorio que nos abstrajo momentáneamente de esa atmósfera enrarecida y asaltada por la desesperanza que rondaba. Esperamos que la transcripción capture la magia del encuentro, esa que nos conmovió y nos hizo sentir que las pedagogías de las afectaciones son indispensables y valen la pena.Fil: Yedaide, María Marta. Universidad Nacional de Mar del Plata. Departamento de Ciencias de la Educación de la Facultad de Humanidades. Mar del Plata; ArgentinaFil: Tranier, José Alberto. Universidad Nacional de Rosario. Facultad de Humanidades y Artes. Centro Internacional de Estudios en Problemáticas Educativas Contemporáneas. Rosario, Argentina