Sciweavers

263 search results - page 3 / 53
» Field Division Routing
Sort
View
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
13 years 11 months ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
INFOCOM
1995
IEEE
13 years 9 months ago
Computing Approximate Blocking Probabilities for a Class of All-Optical Networks
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a ...
Alexander Birman
CIE
2009
Springer
14 years 11 days ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich
ICWN
2007
13 years 7 months ago
Utility-Based Divisible Sensing Task Scheduling in Wireless Sensor Networks
This paper presents a tractable optimization strategies of sensing workload scheduling in wireless sensor networks using Divisible Load Theory (DLT). Because of the limited batter...
Xiaolin Li, Xinxin Liu, Peng Guan, Hui Kang
ANTSW
2010
Springer
13 years 3 months ago
A Robotic Validation of the Attractive Field Model: An Inter-disciplinary Model of Self-regulatory Social Systems
Division of labour in multi-robot systems or multi-robot task allocation (MRTA) is a challenging research issue. We propose to solve this MRTA problem using a set of previously pub...
M. Omar Faruque Sarker, Torbjørn S. Dahl