6110 search results - page 1013 / 1222 » Approximate Computing |
269
click to vote
GECCO
2007
Springer
16 years 17 days ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
167
click to vote
GECCO
2007
Springer
16 years 17 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
213
click to vote
GPC
2007
Springer
16 years 17 days ago
2007
Springer
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
156
click to vote
HYBRID
2007
Springer
16 years 17 days ago
2007
Springer
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...
173
click to vote
ICALP
2007
Springer
16 years 17 days ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...