3946 search results - page 22 / 790 » The computational complexity of choice sets |
102
click to vote
WDAG
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
CSJM
2006
14 years 11 months ago
2006
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
MCS
2009
Springer
15 years 4 months ago
2009
Springer
The meta-learner MLR (Multi-response Linear Regression) has been proposed as a trainable combiner for fusing heterogeneous baselevel classifiers. Although it has interesting prope...
104
click to vote
COMMA
2006
15 years 1 months ago
2006
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
HICSS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper describes the human computer interface of a new emergency medical services application, which uses several emerging technologies to clarify the inherent complexity and ...