1941 search results - page 235 / 389 » On the Hardness of Approximate Reasoning |
152
click to vote
LICS
2007
IEEE
16 years 21 days ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
186
click to vote
ESTIMEDIA
2007
Springer
16 years 17 days ago
2007
Springer
SoCs for multimedia applications typically use only one port to off-chip DRAM for cost reasons. The sharing of interconnect and the off-chip DRAM port by several IP blocks makes t...
170
click to vote
SEMWEB
2007
Springer
16 years 16 days ago
2007
Springer
Hierarchical classifications are used pervasively by humans as a means to organize their data and knowledge about the world. One of their main advantages is that natural language ...
179
click to vote
CCECE
2006
IEEE
16 years 14 days ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
167
click to vote
ICAC
2006
IEEE
16 years 14 days ago
2006
IEEE
Large amount of monitoring data can be collected from distributed systems as the observables to analyze system behaviors. However, without reasonable models to characterize systems...