247 search results - page 25 / 50 » Two Size Measures for Timed Languages |
CP
2003
Springer
15 years 5 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
104
click to vote
ICALP
1999
Springer
15 years 4 months ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
101
click to vote
ASUNAM
2010
IEEE
15 years 7 hour ago
2010
IEEE
—To understand the diffusive spreading of a product in a telecom network, whether the product is a service, handset, or subscription, it can be very useful to study the structure...
107
click to vote
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
WIOPT
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we investigate the stability and delay issues of a two-user multi-access channel at the bit level. The two users, have the option to transmit at a higher rate (measu...