Sciweavers

4854 search results - page 602 / 971
» It's the Programming, Stupid
Sort
View
COR
2008
97views more  COR 2008»
15 years 6 months ago
To be fair or efficient or a bit of both
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
Moshe Zukerman, Musa Mammadov, Liansheng Tan, Irad...
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 6 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Symmetry Breaking for Maximum Satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
João Marques-Silva, Inês Lynce, Vasco...
171
Voted
CORR
2008
Springer
102views Education» more  CORR 2008»
15 years 6 months ago
Spreadsheet modelling for solving combinatorial problems: The vendor selection problem
Spreadsheets have grown up and became very powerful and easy to use tools in applying analytical techniques for solving business problems. Operations managers, production managers...
Pandelis G. Ipsilandis
DISOPT
2008
91views more  DISOPT 2008»
15 years 6 months ago
Partition inequalities for capacitated survivable network design based on directed p-cycles
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
Alper Atamtürk, Deepak Rajan