4498 search results - page 284 / 900 » How to Invent Functions |
115
click to vote
PPDP
2001
Springer
15 years 9 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
166
Voted
ALP
1992
Springer
15 years 9 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
136
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
128
click to vote
FLAIRS
2007
15 years 7 months ago
2007
In this paper, we focus on the ontological concept extraction and evaluation process from HTML documents. In order to improve this process, we propose an unsupervised hierarchical...
126
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...