Sciweavers

4488 search results - page 168 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
122
Voted
SARA
2009
Springer
15 years 10 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
110
Voted
AAAI
2010
15 years 5 months ago
Finding Optimal Solutions to Cooperative Pathfinding Problems
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
Trevor Scott Standley
120
Voted
IVC
2007
114views more  IVC 2007»
15 years 3 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
BPM
2009
Springer
138views Business» more  BPM 2009»
15 years 10 months ago
Graph Matching Algorithms for Business Process Model Similarity Search
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
135
Voted
AMC
2008
206views more  AMC 2008»
15 years 2 months ago
Global-best harmony search
ct 8 Harmony search (HS) is a new meta-heuristic optimization method imitating the music improvisation process where 9 musicians improvise their instruments' pitches searching...
Mahamed G. H. Omran, Mehrdad Mahdavi