Sciweavers

547 search results - page 99 / 110
» dm 2008
Sort
View
AAAI
2008
15 years 1 months ago
An Integrated Reasoning Approach to Moral Decision-Making
We present a computational model, MoralDM, which integrates several AI techniques in order to model recent psychological findings on moral decision-making. Current theories of mor...
Morteza Dehghani, Emmett Tomai, Kenneth D. Forbus,...
DM
2008
129views more  DM 2008»
14 years 11 months ago
On 3-regular 4-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian...
Karola Mészáros
DM
2008
94views more  DM 2008»
14 years 11 months ago
On low degree k-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
Karola Mészáros
DM
2008
81views more  DM 2008»
14 years 11 months ago
The diameter of protean graphs
Abstract. The web graph is a real-world self-organizing network whose vertices correspond to web pages, and whose edges correspond to links between pages. Many stochastic models fo...
Pawel Pralat
DM
2008
72views more  DM 2008»
14 years 11 months ago
(p, 1)-Total labelling of graphs
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
Frédéric Havet, Min-Li Yu