Sciweavers

14158 search results - page 83 / 2832
» Generalized switch-setting problems
Sort
View
SAC
2011
ACM
13 years 26 days ago
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
ICCV
2011
IEEE
12 years 10 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...
SIAMCO
2002
81views more  SIAMCO 2002»
13 years 9 months ago
Optimality Conditions for Irregular Inequality-Constrained Problems
Abstract. We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set i...
Alexey F. Izmailov, Mikhail V. Solodov
TSMC
2002
80views more  TSMC 2002»
13 years 9 months ago
Performance metric alerting: a new design approach for complex alerting problems
Alerting systems and related decision-making automation are widely used to enhance the safety and capability of controlled processes across many applications. Traditional alerting ...
L. C. Yang, J. K. Kuchar
JCSS
2010
112views more  JCSS 2010»
13 years 8 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn