1381 search results - page 46 / 277 » Computational Complexity of Constraint Satisfaction |
126
click to vote
ICNP
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract—Video simulcasting enables a sender to generate replicated streams of different rates, serving receivers of diverse access bandwidths. As replication introduces noticeab...
178
Voted
AMAI
1999
Springer
15 years 3 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
157
Voted
CONSTRAINTS
2008
15 years 3 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...