Sciweavers

14386 search results - page 347 / 2878
» The Chinese Generals Problem
Sort
View
170
Voted
MVA
2008
201views Computer Vision» more  MVA 2008»
15 years 6 months ago
How close are we to solving the problem of automated visual surveillance?
The problem of automated visual surveillance has spawned a lively research area, with 2005 seeing three conferences or workshops and special issues of two major journals devoted to...
Hannah M. Dee, Sergio A. Velastin
SIAMCO
2002
81views more  SIAMCO 2002»
15 years 6 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
164
Voted
TSMC
2002
80views more  TSMC 2002»
15 years 6 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»
15 years 5 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
JDA
2010
88views more  JDA 2010»
15 years 5 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...