Patents by Inventor Philippe Laborie

Philippe Laborie has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9953263
    Abstract: This invention relates to a system, method and computer program product for determining which anytime technique is the most efficient at solving an anytime problem using a first anytime technique and a second anytime technique to determine a first and a second plurality of solutions, respectively, wherein each of the first and the second the plurality of solutions includes a value and an associated computation time, respectively, and each of the first and the second plurality solutions including a minimized value and associated computation time, respectively. Determining a set of delta value ordinates and computation time ordinates. Determining a representative value ordinate and representative computation time ordinate. Determining an efficient anytime technique.
    Type: Grant
    Filed: February 11, 2016
    Date of Patent: April 24, 2018
    Assignee: International Business Machines Corporation
    Inventors: Philippe Laborie, Olivier M. D. Lhomme, Olivier Oudot, Paul Shaw
  • Publication number: 20170236061
    Abstract: This invention relates to a system, method and computer program product for determining which anytime technique is the most efficient at solving an anytime problem using a first anytime technique and a second anytime technique to determine a first and a second plurality of solutions, respectively, wherein each of the first and the second the plurality of solutions includes a value and an associated computation time, respectively, and each of the first and the second plurality solutions including a minimized value and associated computation time, respectively. Determining a set of delta value ordinates and computation time ordinates. Determining a representative value ordinate and representative computation time ordinate. Determining an efficient anytime technique.
    Type: Application
    Filed: February 11, 2016
    Publication date: August 17, 2017
    Inventors: Philippe Laborie, Olivier M.D. Lhomme, Olivier Oudot, Paul Shaw
  • Patent number: 9367801
    Abstract: According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2k further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log2(n) added constraints.
    Type: Grant
    Filed: October 16, 2013
    Date of Patent: June 14, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Philippe Laborie, Paul Shaw
  • Patent number: 9349094
    Abstract: According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2k further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log2(n) added constraints.
    Type: Grant
    Filed: June 4, 2014
    Date of Patent: May 24, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Philippe Laborie, Paul Shaw
  • Publication number: 20150106318
    Abstract: According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2k further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log2(n) added constraints.
    Type: Application
    Filed: October 16, 2013
    Publication date: April 16, 2015
    Applicant: International Business Machines Corporation
    Inventors: Philippe Laborie, Paul Shaw
  • Publication number: 20150106319
    Abstract: According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2k further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log2(n) added constraints.
    Type: Application
    Filed: June 4, 2014
    Publication date: April 16, 2015
    Applicant: International Business Machines Corporation
    Inventors: Philippe Laborie, Paul Shaw
  • Patent number: 5612687
    Abstract: On an aircraft it is proposed that the orientation (pitch and roll attitudes and heading) of a support structure (10), such as the structure supporting the optical head of a head-up control system, be regulated by means of an inertial unit (16). The said unit is firstly placed on its previously regulated rack (14) in the hold of the aircraft and the three orientation parameters are measured. The inertial unit (16) is then placed on an intermediate support (26) fixed to the support structure (10) and the orientation parameters are again measured. Following the comparison of the two measurements, the orientation of the support structure (10) is corrected so as to cancel out their differences.
    Type: Grant
    Filed: May 26, 1995
    Date of Patent: March 18, 1997
    Assignee: Aerospatiale Societe Nationale Industrielle
    Inventors: Gilles Cescon, Philippe Laborie, Claude Maffre, Marie-Odile Neillo