3082 search results - page 21 / 617 » New Bounds for the Controller Problem |
119
Voted
STOC
2002
ACM
16 years 3 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
139
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
143
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
124
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In this paper new, lightweight security and control protocol for Voice over Internet Protocol (VoIP) service is presented. It is the alternative for the IETF's (Internet Engi...
159
Voted
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...