566 search results - page 87 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
105
Voted
CIAC
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
113
click to vote
AAI
2007
15 years 15 days ago
2007
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
113
Voted
EMO
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Topology design of enterprise networks is a hard combinatorial optimization problem. It has numerous constraints, several objectives, and a very noisy solution space. Bes...
101
click to vote
ICRA
2002
IEEE
15 years 5 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
CODES
2007
IEEE
15 years 6 months ago
2007
IEEE
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...