14704 search results - page 237 / 2941 » computing 2007 |
112
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
113
Voted
IJAC
2007
15 years 3 months ago
2007
In this paper we produce a finite algebra which generates a variety with a PSPACE-complete membership problem. We produce another finite algebra with a γ function that grows exp...
88
Voted
INTERNET
2007
15 years 3 months ago
2007
110
Voted
PDCAT
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents a novel service discovery framework for ubiquitous computing called Ubiquitous Computing Service Discovery Framework (UCSDF). UCSDF offers a more flexible and ...
127
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
System builders are becoming increasingly interested in robust design. We believe that a methodology for generating robustness metrics will help the robust design research efforts...