942 search results - page 104 / 189 » Distance Constraint Satisfaction Problems |
114
click to vote
OR
2007
Springer
14 years 9 months ago
2007
Springer
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
108
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
67
Voted
IAT
2008
IEEE
15 years 4 months ago
2008
IEEE
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Although semiautomatic to...
ACMICEC
2006
ACM
15 years 4 months ago
2006
ACM
In this paper we present a proposal for representing soft constraint satisfaction problems (CSPs) within the Semantic Web architecture. The proposal is motivated by the need for a...
85
Voted
CONSTRAINTS
2002
14 years 10 months ago
2002
In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for So...