Sciweavers

914 search results - page 32 / 183
» Branch and Bound on the Network Model
Sort
View
JCIT
2010
197views more  JCIT 2010»
14 years 4 months ago
Comparative Study of M/Er/1 and M/M/1 Queuing Delay Models of the two IP-PBXs
Voice over Internet Protocol (VoIP) is a general term for a family of transmission technologies to delivery of voice communications over IP networks such as the Internet or other ...
Alireza Dehestani, Pedram Hajipour
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
14 years 7 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
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...
MSWIM
2003
ACM
15 years 2 months ago
Connectivity of wireless multihop networks in a shadow fading environment
This article analyzes the connectivity of multihop radio networks in a log-normal shadow fading environment. Assuming the nodes have equal transmission capabilities and are randoml...
Christian Bettstetter, Christian Hartmann
TAINN
2005
Springer
15 years 3 months ago
An Evolutionary Local Search Algorithm for the Satisfiability Problem
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
Levent Aksoy, Ece Olcay Gunes