182 search results - page 28 / 37 » Reformulation of Global Constraints in Answer Set Programmin... |
107
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
112
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
LPNMR
2009
Springer
2009
Springer
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs
15 years 4 months ago
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility of field-programmable devices to customize architectures for paralle...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
122
Voted
TACAS
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...