21324 search results - page 524 / 4265 » Making the case for computing |
194
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
182
click to vote
CICLING
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Automated language identification of written text is a wellestablished research domain that has received considerable attention in the past. By now, efficient and effecti...
203
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
This paper considers the design of agent strategies for deciding whether to help other members of a group with whom an agent is engaged in a collaborative activity. Three characte...
197
click to vote
AI
2010
Springer
15 years 7 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
194
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...