Sciweavers

1445 search results - page 126 / 289
» Uniformly Hard Languages
Sort
View
FM
2008
Springer
93views Formal Methods» more  FM 2008»
15 years 5 months ago
Finding Minimal Unsatisfiable Cores of Declarative Specifications
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
Emina Torlak, Felix Sheng-Ho Chang, Daniel Jackson
AAAI
2010
15 years 5 months ago
Generalized Task Markets for Human and Machine Computation
We discuss challenges and opportunities for developing generalized task markets where human and machine intelligence are enlisted to solve problems, based on a consideration of th...
Dafna Shahaf, Eric Horvitz
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
15 years 5 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski
CONCURRENCY
2000
99views more  CONCURRENCY 2000»
15 years 3 months ago
The Java memory model is fatally flawed
The Java memory model described in Chapter 17 of the Java Language Specification gives constraints on how threads interact through memory. This chapter is hard to interpret and po...
William Pugh
130
Voted
ECSA
2010
Springer
15 years 2 months ago
Industry taxonomy engineering: the case of the European software ecosystem
Presently, no methods exist that support the creation process of an industry taxonomy within a specific domain. Without such a method, taxonomies remain erroneous, making the deve...
Ivo Hunink, Rene van Erk, Slinger Jansen, Sjaak Br...