325 search results - page 46 / 65 » Proofs of Restricted Shuffles |
147
click to vote
CPAIOR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
140
click to vote
CSL
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
140
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
243
click to vote
MSWIM
2006
ACM
15 years 10 months ago
2006
ACM
Mobile devices should allow users to exploit services anytime, without any place restriction and in a transparent way. The Bluetooth technology achieves this feature, by providing...
123
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...