8413 search results - page 324 / 1683 » Ordering Problem Subgoals |
162
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
195
click to vote
SAGA
2001
Springer
15 years 11 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
190
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
169
click to vote
VLDB
1990
ACM
15 years 10 months ago
1990
ACM
Non-monotonic knowledge evolutions and exceptions constitute a complex theoritical and practical problem. The state of the art shows a rich and surprising diversity of approaches....
170
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...