Sciweavers

338 search results - page 54 / 68
» Approximation Spaces and Information Granulation
Sort
View
AAAI
2007
14 years 11 months ago
Partial Revelation Automated Mechanism Design
In most mechanism design settings, optimal general-purpose mechanisms are not known. Thus the automated design of mechanisms tailored to specific instances of a decision scenario...
Nathanael Hyafil, Craig Boutilier
CEC
2007
IEEE
14 years 11 months ago
Fitness inheritance in evolutionary and multi-objective high-level synthesis
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
Christian Pilato, Gianluca Palermo, Antonino Tumeo...
NIPS
2007
14 years 11 months ago
Bayesian Inference for Spiking Neuron Models with a Sparsity Prior
Generalized linear models are the most commonly used tools to describe the stimulus selectivity of sensory neurons. Here we present a Bayesian treatment of such models. Using the ...
Sebastian Gerwinn, Jakob Macke, Matthias Seeger, M...
WAE
1998
118views Algorithms» more  WAE 1998»
14 years 10 months ago
Guarding Scenes against Invasive Hypercubes
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...
AAAI
1996
14 years 10 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole