Sciweavers

706 search results - page 72 / 142
» Super Solutions in Constraint Programming
Sort
View
LPNMR
2009
Springer
15 years 4 months ago
Manifold Answer-Set Programs for Meta-reasoning
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
Wolfgang Faber, Stefan Woltran
ICSE
2011
IEEE-ACM
14 years 3 months ago
Unifying execution of imperative and declarative code
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...
Aleksandar Milicevic, Derek Rayside, Kuat Yessenov...
ICASSP
2010
IEEE
15 years 1 days ago
Semi-Supervised Hyperspectral Unmixing via the Weighted Lasso
In this paper a novel approach for semi-supervised hyperspectral unmixing is presented. First, it is shown that this problem inherently accepts a sparse solution. Then, based on t...
Konstantinos Themelis, Athanasios A. Rontogiannis,...
ANOR
2002
67views more  ANOR 2002»
14 years 11 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
LCTRTS
2001
Springer
15 years 4 months ago
A Dynamic Programming Approach to Optimal Integrated Code Generation
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
Christoph W. Keßler, Andrzej Bednarski