7092 search results - page 281 / 1419 » Parallelizing constraint programs |
121
click to vote
AIPS
2008
15 years 4 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
137
click to vote
IFIPPACT
1994
15 years 3 months ago
1994
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
131
click to vote
JAIR
2008
15 years 2 months ago
2008
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
122
click to vote
JOTA
2011
14 years 9 months ago
2011
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
136
click to vote
ASP
2005
Springer
15 years 8 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...