12459 search results - page 250 / 2492 » cans 2006 |
168
click to vote
AIM
2006
15 years 6 months ago
2006
We are developing Companion Cognitive Systems, a new kind of software that can be effectively treated as a collaborator. Aside from their potential utility, we believe this effort...
135
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosin...
157
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
156
Voted
COMBINATORICS
2006
15 years 6 months ago
2006
In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (...
156
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...