Sciweavers

4081 search results - page 166 / 817
» The Impact of Constraint Programming
Sort
View
AIPS
2008
15 years 7 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
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 ...
Cédric Pralet, Gérard Verfaillie
157
Voted
JAIR
2008
136views more  JAIR 2008»
15 years 5 months ago
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
James Clarke, Mirella Lapata
147
Voted
JOTA
2011
104views more  JOTA 2011»
14 years 12 months ago
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
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...
Lingchen Kong, Levent Tunçel, Naihua Xiu
ASP
2005
Springer
15 years 10 months ago
A Preliminary Report on Integrating of Answer Set and Constraint Solving
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...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
CP
2005
Springer
15 years 10 months ago
Specialised Constraints for Stable Matching Problems
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Chris Unsworth, Patrick Prosser