Sciweavers

631 search results - page 74 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
IJCAI
2001
13 years 11 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
ICML
2010
IEEE
13 years 11 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
CGF
2008
110views more  CGF 2008»
13 years 10 months ago
Motorcycle Graphs: Canonical Quad Mesh Partitioning
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
AMC
2006
84views more  AMC 2006»
13 years 10 months ago
Estimation of parameters in carbon sequestration models from net ecosystem exchange data
The use of net ecosystem exchange (NEE) data to estimate carbon transfer coefficients is investigated in the context of a deterministic compartmental carbon sequestration system. ...
Luther White, Frances White, Yiqi Luo, Tao Xu
SIAMCO
2008
96views more  SIAMCO 2008»
13 years 10 months ago
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
Jean B. Lasserre, Didier Henrion, Christophe Prieu...