4940 search results - page 342 / 988 » On the Complexity of Universal Programs |
188
click to vote
GPEM
2008
15 years 6 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
163
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
176
click to vote
AAAI
2006
15 years 8 months ago
2006
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
217
click to vote
JMLR
2012
13 years 9 months ago
2012
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
135
click to vote
VL
2003
IEEE
15 years 12 months ago
2003
IEEE
Interpreting general purpose programming constructs can be difficult because it requires context, such as knowledge of language syntax or idioms, which users may not have readily ...