376 search results - page 61 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
DBA
2006
13 years 9 months ago
2006
In order to facilitate query processing, the information contained in data warehouses is typically stored as a set of materialized views. Deciding which views to materialize prese...
ICAI
2003
13 years 9 months ago
2003
Many real-world search and optimization problems naturally involve constraint handling. Recently, quite a few heuristic methods were proposed to solve the nonlinear constrained op...
GECCO
2009
Springer
14 years 10 days ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
GIS
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...