Sciweavers

986 search results - page 33 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Apprenticeship learning using linear programming
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
Umar Syed, Michael H. Bowling, Robert E. Schapire
PPDP
2010
Springer
13 years 5 months ago
Rewrite-based verification of XML updates
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
Florent Jacquemard, Michaël Rusinowitch
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
13 years 11 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
CAGD
2002
98views more  CAGD 2002»
13 years 7 months ago
Comparison of interval methods for plotting algebraic curves
This paper compares the performance and efficiency of different function range interval methods for plotting f(x, y) = 0 on a rectangular region based on a subdivision scheme, whe...
Ralph R. Martin, Huahao Shou, Irina Voiculescu, Ad...
ENTCS
2008
115views more  ENTCS 2008»
13 years 7 months ago
Time Separation of Events: An Inverse Method
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
Emmanuelle Encrenaz, Laurent Fribourg