Sciweavers

22 search results - page 4 / 5
» A BIST Solution for The Test of I O Speed
Sort
View
ATAL
2007
Springer
14 years 18 days ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
COMPGEOM
2009
ACM
14 years 28 days ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
BMCBI
2007
115views more  BMCBI 2007»
13 years 6 months ago
A novel, fast, HMM-with-Duration implementation - for application with a new, pattern recognition informed, nanopore detector
Background: Hidden Markov Models (HMMs) provide an excellent means for structure identification and feature extraction on stochastic sequential data. An HMM-with-Duration (HMMwD) ...
Stephen Winters-Hilt, Carl Baribault
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
13 years 10 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
14 years 17 days ago
Generating large-scale neural networks through discovering geometric regularities
Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that ...
Jason Gauci, Kenneth O. Stanley