Result 1 to 20 of 98 total
A note on exact algorithms for vertex ordering problems on graphs. (English)
Theory Comput. Syst. 50, No. 3, 420-432 (2012).
1
Trust alignment: a sine qua non of open multi-agent systems. (English)
Meersman, Robert (ed.) et al., On the move to meaningful internet systems: OTM 2011. Confederated international conferences: CoopIS, DOA-SVI, and ODBASE 2011, Hersonissos, Crete, Greece, October 17‒21, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-25108-5/pbk). Lecture Notes in Computer Science 7044, 182-199 (2011).
2
Recoverable robust knapsacks: $Γ$-scenarios. (English)
Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 583-588 (2011).
3
Designing AC power grids using integer linear programming. (English)
Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 478-483 (2011).
4
Cutset inequalities for robust network design. (English)
Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 118-123 (2011).
5
A chance-constrained model and cutting planes for fixed broadband wireless networks. (English)
Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 37-42 (2011).
6
Treewidth computations. II. Lower bounds. (English)
Inf. Comput. 209, No. 7, 1103-1119 (2011).
7
An experimental evaluation of treewidth at most four reductions. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 218-229 (2011).
8
On cut-based inequalities for capacitated network design polyhedra. (English)
Networks 57, No. 2, 141-156 (2011).
9
Recoverable robust knapsacks: the discrete scenario case (English)
Optimization Letters 5, No. 3, 379-392 (2011).
10
Talking about trust in heterogeneous multi-agent systems (English)
IJCAI, 2820-2821 (2011).
11
Trust alignment: A sine qua non of open multi-agent systems (English)
OTM Conferences (1), 182-199 (2011).
12
A chance-constrained model and cutting planes for fixed broadband wireless networks (English)
INOC, 37-42 (2011).
13
Cutset inequalities for robust network design (English)
INOC, 118-123 (2011).
14
Designing AC power grids using integer linear programming (English)
INOC, 478-483 (2011).
15
Recoverable robust knapsacks: $Γ$-scenarios (English)
INOC, 583-588 (2011).
16
An integer linear programming model for optimal self protection multi-path selection (English)
ICUMT, 1-7 (2011).
17
An experimental evaluation of treewidth at most four reductions (English)
SEA, 218-229 (2011).
18
On the robustness of optimal network designs (English)
ICC, 1-5 (2011).
19
Bandwidth assignment for reliable fixed broadband wireless networks (English)
WOWMOM, 1-6 (2011).
20
Result 1 to 20 of 98 total
Start
Contact
Print
General Help
