182 search results - page 10 / 37 » Removing Propagation Redundant Constraints in Redundant Mode... |
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
73
Voted
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
In low bit-rate coders, the near-sample and far-sample redundancies of the speech signal are usually removed by a cascade of a shortterm and a long-term linear predictor. These tw...
ECCV
2004
Springer
15 years 3 months ago
2004
Springer
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
82
Voted
EWSN
2007
Springer
15 years 9 months ago
2007
Springer
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
113
click to vote
CP
2011
Springer
13 years 9 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...