245 search results - page 28 / 49 » Efficient Solving of Time-dependent Answer Set Programs |
104
click to vote
IJKSR
2011
14 years 3 months ago
2011
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
112
click to vote
ICAI
2010
14 years 9 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
AAAI
2006
15 years 1 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
128
click to vote
TKDE
2012
13 years 2 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
113
Voted
ICML
2009
IEEE
16 years 17 days ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...