605 search results - page 37 / 121 » Visual Analogy in Problem Solving |
FECS
2006
13 years 9 months ago
2006
- The complete history of problem solving in computer sciences is a history of continuous attempts to discover, study, mimic and implement ideas, models, metaphors, and sequences f...
ARSCOM
2007
13 years 7 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
COMBINATORICS
2006
13 years 7 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Abstract. This article presents a new open-source C++ implementation to solve the SLAM problem, which is focused on genericity, versatility and high execution speed. It is based on...