4066 search results - page 481 / 814 » Almost Complete Sets |
190
Voted
STACS
2010
Springer
16 years 2 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
214
click to vote
BIRTHDAY
2009
Springer
16 years 2 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...
163
Voted
HYBRID
2009
Springer
16 years 2 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 ...
228
click to vote
DATE
2009
IEEE
16 years 2 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...
204
Voted
ICASSP
2009
IEEE
16 years 2 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...