Sciweavers

1578 search results - page 22 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
NAACL
2010
13 years 6 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
ICC
2007
IEEE
130views Communications» more  ICC 2007»
14 years 2 months ago
Off-network Control for Scalable Routing in Very Large Sensor Networks
—This paper presents an architectural solution to address the problem of scalable routing in very large sensor networks. The control complexities of the existing sensor routing p...
Tao Wu, Subir K. Biswas
ATMOS
2010
183views Optimization» more  ATMOS 2010»
13 years 7 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
TPDS
2010
112views more  TPDS 2010»
13 years 7 months ago
Resource Scheduling in Wireless Networks Using Directional Antennas
—Due to a continued increase in the speed and capacities of computing devices, combined with our society’s growing need for mobile communication capabilities, multihop wireless...
Imad Jawhar, Jie Wu, Dharma P. Agrawal
PERCOM
2006
ACM
14 years 8 months ago
Resource Allocation in Wireless Networks Using Directional Antennas
With the continued increase of speed and capacities of computing devices and the growing needs of people for mobile computing capabilities, Mobile ad hoc networks (MANETs) have gai...
Imad Jawhar, Jie Wu