8647 search results - page 610 / 1730 » The Container Selection Problem |
193
click to vote
ICWS
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
175
click to vote
AAAI
2006
15 years 8 months ago
2006
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
208
click to vote
ACID
2006
15 years 8 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
188
click to vote
GD
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
169
click to vote
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: t...