2905 search results - page 343 / 581 » Formal Memetic Algorithms |
129
click to vote
CI
2004
15 years 3 months ago
2004
Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and...
140
click to vote
CSCW
2004
ACM
15 years 3 months ago
2004
ACM
We describe a new collaborative technology that bridges the gap between ad hoc collaboration in email and more formal collaboration in structured shared workspaces. Our approach is...
134
click to vote
DM
2002
15 years 3 months ago
2002
This paper provides an overview of methods and systems developed for record linkage. Modern record linkage begins with the pioneering work of Newcombe and is especially based on t...
139
click to vote
JLP
2000
15 years 3 months ago
2000
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
135
click to vote
ETT
2002
15 years 3 months ago
2002
In this paper, a method is presented for the efficient estimation of rare-event (buffer overflow) probabilities in queueing networks using importance sampling. Unlike previously pr...