Sciweavers

3913 search results - page 236 / 783
» complexity 2006
Sort
View
JAR
2006
106views more  JAR 2006»
15 years 5 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
JCNS
2006
69views more  JCNS 2006»
15 years 5 months ago
Effects of stimulus transformations on estimates of sensory neuron selectivity
Stimulus selectivity of sensory systems is often characterized by analyzing responseconditioned stimulus ensembles. However, in many cases these response-triggered stimulus sets h...
Alexander G. Dimitrov, Tomás Gedeon
169
Voted
JCP
2006
91views more  JCP 2006»
15 years 5 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
JCSS
2006
63views more  JCSS 2006»
15 years 5 months ago
Error-bounded probabilistic computations between MA and AM
We introduce the probabilistic class SBP which is defined in a BPP-like manner. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probabil...
Elmar Böhler, Christian Glaßer, Daniel ...
JEC
2006
88views more  JEC 2006»
15 years 5 months ago
Synchroscalar: Evaluation of an embedded, multi-core architecture for media applications
We present an overview of the Synchroscalar single-chip, multi-core processor. Through the design of Synchroscalar, we find that high energy efficiency and low complexity can be a...
John Oliver, Ravishankar Rao, Diana Franklin, Fred...