Sciweavers

1941 search results - page 62 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
IJON
2007
98views more  IJON 2007»
14 years 9 months ago
Convergent design of piecewise linear neural networks
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...
Hema Chandrasekaran, Jiang Li, W. H. Delashmit, Pr...
DAC
2009
ACM
15 years 10 months ago
Computing bounds for fault tolerance using formal techniques
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
André Sülflow, Görschwin Fey, Rol...
AINA
2010
IEEE
15 years 2 months ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli
IPSN
2009
Springer
15 years 4 months ago
Application-informed radio duty-cycling in a re-taskable multi-user sensing system
As sensor networks mature, there will be an increasing need for re-usable, dynamically taskable software systems that support multiple concurrent applications. In this paper, we c...
Omprakash Gnawali, Jongkeun Na, Ramesh Govindan
TAMC
2009
Springer
15 years 4 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens