3510 search results - page 542 / 702 » Searching with numbers |
204
click to vote
EWCBR
2008
Springer
15 years 8 months ago
2008
Springer
To meet time constraints, a CBR system must control the time spent searching in the case base for a solution. In this paper, we presents the results of a case study comparing the p...
173
Voted
FOIKS
2008
Springer
2008
Springer
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
15 years 8 months ago
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
129
click to vote
FPL
2008
Springer
15 years 8 months ago
2008
Springer
We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules ...
127
click to vote
CATS
2007
15 years 8 months ago
2007
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
166
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
It is well known that local patterns are at the core of a lot of knowledge which may be discovered from data. Nevertheless, use of local patterns is limited by their huge number an...