Sciweavers

944 search results - page 36 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 21 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 1 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
CAISE
2009
Springer
15 years 4 months ago
A Heuristic Method for Business Process Model Evaluation
In this paper, we present a heuristic approach for finding errors and possible improvements in business process models. First, we translate the information that is included in a m...
Volker Gruhn, Ralf Laue
AIPS
2010
15 years 6 days ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
JAIR
2011
134views more  JAIR 2011»
14 years 4 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...