Sciweavers

808 search results - page 144 / 162
» What Is Answer Set Programming
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 11 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
ICSE
2009
IEEE-ACM
14 years 9 months ago
How we refactor, and how we know it
Much of what we know about how programmers refactor in the wild is based on studies that examine just a few software projects. Researchers have rarely taken the time to replicate ...
Emerson R. Murphy-Hill, Chris Parnin, Andrew P. Bl...
CP
2009
Springer
14 years 9 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
DIGRA
2005
Springer
14 years 2 months ago
Girls Creating Games: Challenging Existing Assumptions about Game Content
In a reinforcing cycle, few females create games and fewer girls than boys play games. In this paper, we increase our understanding of what girls like about games and gaming by de...
Jill Denner, Steven Bean, Linda L. Werner