66 search results - page 7 / 14 » Easy distributions for combinatorial optimization problems w... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
ECCV
1998
Springer
14 years 9 months ago
1998
Springer
Assume that some objects are present in an image but can be seen only partially and are overlapping each other. To recognize the objects, we have to rstly separate the objects from...
ICTAI
1999
IEEE
13 years 11 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
ICCAD
2003
IEEE
14 years 10 days ago
2003
IEEE
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...