3172 search results - page 219 / 635 » On the Random-Self-Reducibility of Complete Sets |
180
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
137
click to vote
HYBRID
2009
Springer
16 years 1 months ago
2009
Springer
This paper aims to simplify recent efforts proposed by the Berkeley school in giving a formal semantics to the Ptolemy toolbox. We achieve this by developing a simple and elegant ...
199
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
184
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Many computer vision systems try to infer semantic information about a video scene content by looking at the time series of the silhouettes of the moving objects. This paper propo...
137
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Although direct reciprocity (Tit-for-Tat) contribution systems have been successful in reducing freeloading in peerto-peer overlays, it has been shown that, unless the ...