2845 search results - page 42 / 569 » Constraints over Ontologies |
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— The main task in OFDM downlink scheduling design is to maximize some kind of utility considering user specific as well as system induced constraints. A typical example is the ...
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
SEMWEB
2010
Springer
13 years 6 months ago
2010
Springer
As knowledge bases move into the landscape of larger ontologies and have terabytes of related data, we must work on optimizing the performance of our tools. We are easily tempted t...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDM/TDM spectrum allocations and total power constra...