1984 search results - page 184 / 397 » The colourful feasibility problem |
193
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
171
Voted
PDP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper describes the design of a crawler devised to perform the periodic retrieval of Web documents for a search engine able to accept on-line updates in a concurrent manner. ...
220
click to vote
RTSS
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
141
click to vote
VTC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—In this work we explore the feasibility of implementing infrastructure-to-vehicle (I2V) communication through the UMTS infrastructure. We identify the problems that aris...
222
click to vote
DASFAA
2007
IEEE
16 years 1 months ago
2007
IEEE
Networks of thousands of sensors present a feasible and economic solution to some of our most challenging problems, such as real-time traffic modeling, military sensing and trackin...