Sciweavers

5606 search results - page 781 / 1122
» Randomization Techniques for Graphs.
Sort
View
TKDE
2008
123views more  TKDE 2008»
15 years 6 months ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko
BC
2004
91views more  BC 2004»
15 years 6 months ago
Simulation and parameter estimation of dynamics of synaptic depression
Abstract. Synaptic release was simulated using a Simulink sequential storage model with three vesicular pools. Modeling was modular and easily extendable to the systems with greate...
F. Aristizabal, M. I. Glavinovic
ET
2000
145views more  ET 2000»
15 years 6 months ago
Fast Test Pattern Generation for Sequential Circuits Using Decision Diagram Representations
The paper presents a novel hierarchical approach to test pattern generation for sequential circuits based on an input model of mixed-level decision diagrams. A method that handles,...
Jaan Raik, Raimund Ubar
MOR
2000
162views more  MOR 2000»
15 years 6 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
TEC
2002
163views more  TEC 2002»
15 years 6 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon