559 search results - page 60 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
HM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
KDD
1997
ACM
13 years 12 months ago
1997
ACM
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice...