1568 search results - page 138 / 314 » The problem of examination questions in algorithmics |
149
Voted
ICDCS
1998
IEEE
15 years 9 months ago
1998
IEEE
Novel real-time applications require highperformance real-time distributed systems, and therefore high-performance real-time networks. We examine a Hard Real-Time Distributed Mult...
144
click to vote
DM
1999
15 years 4 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
164
click to vote
AAMAS
2011
Springer
14 years 11 months ago
2011
Springer
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
136
click to vote
JMLR
2010
14 years 11 months ago
2010
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
187
click to vote
SIGECOM
2011
ACM
14 years 7 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...