Sciweavers

434 search results - page 11 / 87
» A Semantic Caching Method Based on Linear Constraints
Sort
View
CAV
2009
Springer
218views Hardware» more  CAV 2009»
16 years 5 months ago
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
Abstract. We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm, which can be viewed as a semantic generaliza...
Isil Dillig, Thomas Dillig, Alex Aiken
AMAI
1999
Springer
15 years 4 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
ATAL
2007
Springer
15 years 11 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
CP
2001
Springer
15 years 9 months ago
A Temporal Concurrent Constraint Programming Calculus
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
Catuscia Palamidessi, Frank D. Valencia
VRST
2005
ACM
15 years 10 months ago
Computing inverse kinematics with linear programming
Inverse Kinematics (IK) is a popular technique for synthesizing motions of virtual characters. In this paper, we propose a Linear Programming based IK solver (LPIK) for interactiv...
Edmond S. L. Ho, Taku Komura, Rynson W. H. Lau