1941 search results - page 124 / 389 » On the Hardness of Approximate Reasoning |
186
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
165
click to vote
DSN
2006
IEEE
16 years 14 days ago
2006
IEEE
Recent research has shown that even modern hard disks have complex failure modes that do not conform to “failstop” operation. Disks exhibit partial failures like block access ...
194
click to vote
CLOUDCOM
2010
Springer
15 years 4 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
109
click to vote
LICS
2008
IEEE
16 years 24 days ago
2008
IEEE
Individual-based models are a relatively new approach to modelling dynamical systems of interacting entities, for example molecules in a biological cell. Although they are computa...
141
click to vote
ICCBR
2005
Springer
15 years 12 months ago
2005
Springer
Traditional CBR approaches imply centralized storage of the case base and, most of them, the retrieval of similar cases by an exhaustive comparison of the case to be solved with th...