1650 search results - page 115 / 330 » The HOM problem is decidable |
140
click to vote
JCO
2011
14 years 11 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
152
Voted
CVIU
2011
14 years 7 months ago
2011
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
108
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
155
click to vote
ECAI
1990
Springer
15 years 8 months ago
1990
Springer
In case-based reasoning (CBR) a problem is solved by matching the problem description to a previously solved case, using the past solution in solving the new problem. A case-based...
111
Voted
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimiz...