Sciweavers

1300 search results - page 133 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
WWW
2009
ACM
15 years 10 months ago
Combining global optimization with local selection for efficient QoS-aware service composition
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
Mohammad Alrifai, Thomas Risse
JAIR
2007
159views more  JAIR 2007»
14 years 9 months ago
Combination Strategies for Semantic Role Labeling
This paper introduces and analyzes a battery of inference models for the problem of semantic role labeling: one based on constraint satisfaction, and several strategies that model...
Mihai Surdeanu, Lluís Màrquez, Xavie...
AAAI
2006
14 years 11 months ago
An Efficient Way of Breaking Value Symmetries
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
Jean-François Puget
SARA
2009
Springer
15 years 4 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
ICALT
2008
IEEE
15 years 4 months ago
A Framework for Semantic Group Formation
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
Asma Ounnas, Hugh C. Davis, David E. Millard