3367 search results - page 269 / 674 » Incremental assignment problem |
144
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
142
click to vote
CORR
2012
Springer
14 years 48 min ago
2012
Springer
Abstract—This study considers an orthogonal frequencydivision multiple-access (OFDMA)-based multi-user two-way relay network where multiple mobile stations (MSs) communicate with...
138
click to vote
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— Classical path planning does not address many of the challenges of robotic systems subject to differential constraints. While there have been many recent efforts to develop mot...
127
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...