6110 search results - page 131 / 1222 » Approximate Computing |
176
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
177
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
176
click to vote
COMPGEOM
2009
ACM
16 years 28 days ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
188
click to vote
DEXA
2010
Springer
15 years 7 months ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
152
click to vote
PEPM
2009
ACM
16 years 3 months ago
2009
ACM
ract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying ope...