2738 search results - page 208 / 548 » The Frobenius Problem and Its Generalizations |
153
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In pa...
158
click to vote
CAV
2001
Springer
15 years 10 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
161
click to vote
FLAIRS
2008
15 years 8 months ago
2008
Simple Temporal Networks (STNs) are frequently used in scheduling applications, as they provide a powerful and general tool for managing temporal constraints. One obstacle to thei...
183
Voted
IPCO
1992
15 years 7 months ago
1992
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
149
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
One of the key problems in cognitive radio (CR) is the detection of primary activity in order to determine which parts of the spectrum are available for opportunistic access. This...