Sciweavers

11345 search results - page 1738 / 2269
» Foundations of Computer Science
Sort
View
JGAA
2006
108views more  JGAA 2006»
15 years 6 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello
KER
2006
158views more  KER 2006»
15 years 6 months ago
Formal systems for persuasion dialogue
This article reviews formal systems that regulate persuasion dialogues. In such dialogues two or more participants aim to resolve a difference of opinion, each trying to persuade ...
Henry Prakken
IIE
2007
81views more  IIE 2007»
15 years 6 months ago
Visualize and Open Up
Motivating students of the Nintendo generation for Computer Science can only be achieved by providing them with an exiting and fresh CS1 course. The article describes the experienc...
Michela Pedroni, Till G. Bay
AAI
2005
93views more  AAI 2005»
15 years 6 months ago
Learning By Feeling: Evoking Empathy With Synthetic Characters
Virtual environments are now becoming a promising new technology to be used in the development of interactive learning environments for children. Perhaps triggered by the success ...
Ana Paiva, João Dias, Daniel Sobral, Ruth A...
SIGPLAN
2008
15 years 6 months ago
Rethinking pedagogy for teaching PL with more than PL concepts in mind
Depending on individual department goals, undergraduate computer science educators teach theoretical concepts and skills with varying priorities on preparing students for continui...
Lori L. Pollock
« Prev « First page 1738 / 2269 Last » Next »