1929 search results - page 53 / 386 » An Approach to Limit the Wynot Problem |
191
click to vote
ASM
2010
ASM
15 years 11 months ago
2010
ASM
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
170
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
177
click to vote
CCGRID
2002
IEEE
15 years 11 months ago
2002
IEEE
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
164
click to vote
AAAI
2006
15 years 7 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
192
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...