601 search results - page 39 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
122
click to vote
SAC
1994
ACM
15 years 5 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
120
click to vote
AAAI
2008
15 years 3 months ago
2008
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
116
click to vote
CONEXT
2010
ACM
14 years 11 months ago
2010
ACM
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
140
Voted
STOC
2009
ACM
16 years 2 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...
142
click to vote
GIS
1995
ACM
15 years 5 months ago
1995
ACM
: Usually spatial planning problems involve a large number of decision makers with different backgrounds and interests. The process of Collaborative Spatial Decision Making (CSDM)...