Sciweavers

3663 search results - page 83 / 733
» Problems in the ontology of computer programs
Sort
View
SIGCSE
2010
ACM
189views Education» more  SIGCSE 2010»
15 years 4 months ago
Principles of asking effective questions during student problem solving
Using effective teaching practices is a high priority for educators. One important pedagogical skill for computer science instructors is asking effective questions. This paper pre...
Kristy Elizabeth Boyer, William Lahti, Robert Phil...
CP
2005
Springer
15 years 3 months ago
Breaking All Value Symmetries in Surjection Problems
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
Jean-Francois Puget
NETWORKS
2008
14 years 9 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
CG
1998
Springer
15 years 2 months ago
A Survey of Tsume-Shogi Programs Using Variable-Depth Search
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...
Reijer Grimbergen
SUM
2007
Springer
15 years 4 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...