7167 search results - page 537 / 1434 » Answer Set Programming |
138
Voted
JCT
2000
15 years 4 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
142
click to vote
SEMWEB
2010
Springer
15 years 2 months ago
2010
Springer
The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confr...
124
click to vote
PLDI
2012
ACM
13 years 7 months ago
2012
ACM
Efficient communication and synchronization is crucial for finegrained parallelism. Libraries providing such features, while indispensable, are difficult to write, and often ca...
146
click to vote
JMLR
2012
13 years 7 months ago
2012
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
110
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
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 ...