221 search results - page 20 / 45 » Twinkle: programming with color |
124
click to vote
AI
2004
Springer
14 years 11 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
100
click to vote
CP
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
100
click to vote
DAGSTUHL
2006
15 years 1 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
131
click to vote
SOFTVIS
2010
ACM
14 years 9 months ago
2010
ACM
Large clusters of mutual dependence have long been regarded as a problem impeding comprehension, testing, maintenance, and reverse engineering. An effective visualization can aid ...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...