5180 search results - page 227 / 1036 » Concurrency, Time, and Constraints |
174
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We investigate optimal resource allocation for delaylimited cooperative communication in time varying wireless networks. Motivated by real-time applications that have st...
186
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
147
click to vote
FOSSACS
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
181
click to vote
CP
2005
Springer
16 years 5 days ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
163
click to vote
SAT
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...