Sciweavers

2343 search results - page 178 / 469
» Visual-Concept Search Solved
Sort
View
173
Voted
AMAI
2004
Springer
15 years 10 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
111
Voted
ECAI
2004
Springer
15 years 10 months ago
Multiple Relaxations in Temporal Planning
CRIKEY is a planner that separates out the scheduling from the classical parts of temporal planning. This can be seen as a relaxation of the temporal information during the classic...
Keith Halsey, Derek Long, Maria Fox
130
Voted
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
15 years 9 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo
107
Voted
CEC
2007
IEEE
15 years 9 months ago
Ranking-Dominance and Many-Objective Optimization
An alternative relation to Pareto-dominance is studied. The relation is based on ranking a set of solutions according to each separate objective and an aggregation function to calc...
Saku Kukkonen, Jouni Lampinen
BIRTHDAY
2006
Springer
15 years 8 months ago
Best-First Rippling
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
Moa Johansson, Alan Bundy, Lucas Dixon