1381 search results - page 47 / 277 » Computational Complexity of Constraint Satisfaction |
117
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
134
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
116
Voted
NSDI
2007
15 years 6 months ago
2007
Determining the physical location of Internet hosts is a critical enabler for many new location-aware services. In this paper, we present Octant, a novel, comprehensive framework ...
144
click to vote
WIOPT
2011
IEEE
14 years 7 months ago
2011
IEEE
—In this paper, we address the spectrum portfolio optimization (SPO) question in the context of secondary spectrum markets, where bandwidth (spectrum access rights) can be bought...
141
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...