26354 search results - page 255 / 5271 » How we refactor, and how we know it |
205
click to vote
SIGMOD
1994
ACM
15 years 10 months ago
1994
ACM
In the mobile wireless computing environment of the future, a large number of users, equipped with low-powered palmtop machines, will query databases over wireless communication ch...
155
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
175
click to vote
FQAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The Internet has instigated a critical need for automated tools that facilitate integrating countless databases. Since non-technical end users are often the ultimate repo...
184
click to vote
AIIA
2003
Springer
15 years 10 months ago
2003
Springer
The aim of this paper is to show how abduction can be used in classification tasks when we deal with incomplete data. Some classifiers, even if based on decision tree induction lik...
186
click to vote
DESRIST
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...