2168 search results - page 127 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
160
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
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...
146
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
164
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
PERCOM
2010
ACM
15 years 2 months ago
2010
ACM
Abstract—The construction of world models typically requires laborious survey and cataloguing of a building’s contents. OpenRoomMap attempts to crowd-source this information by...
137
click to vote
ECCV
2000
Springer
16 years 5 months ago
2000
Springer
This paper considers a fundamental problem in visual motion perception, namely the problem of egomotion estimation based on visual input. Many of the existing techniques for solvin...