Sciweavers

13841 search results - page 290 / 2769
» Algorithms and Constraint Programming
Sort
View
PPDP
2010
Springer
15 years 5 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
FORMATS
2005
Springer
16 years 6 days ago
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
Patricia Bouyer, François Laroussinie, Pier...
IJCAI
1997
15 years 8 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
EOR
2010
140views more  EOR 2010»
15 years 4 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
ICRA
2005
IEEE
130views Robotics» more  ICRA 2005»
16 years 8 days ago
Constraint-Based Motion Planning of Deformable Robots
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...
Russell Gayle, Ming C. Lin, Dinesh Manocha