2430 search results - page 261 / 486 » Computing Tutte Polynomials |
143
click to vote
RTSS
2002
IEEE
15 years 9 months ago
2002
IEEE
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
158
click to vote
SAGT
2009
Springer
15 years 8 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
142
click to vote
EUROCOLT
1997
Springer
15 years 8 months ago
1997
Springer
Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning app...
126
click to vote
AAAI
2004
15 years 5 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
137
click to vote
JCB
2006
15 years 4 months ago
2006
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...