Sciweavers

570 search results - page 78 / 114
» A Connectivity Constraint Using Bridges
Sort
View
JIRS
2010
104views more  JIRS 2010»
13 years 8 months ago
On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles
Abstract This paper presents a methodology based on a variation of the Rapidlyexploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial veh...
Armando Alves Neto, Douglas Guimarães Macha...
CPAIOR
2010
Springer
13 years 7 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
MOBICOM
2006
ACM
14 years 3 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
INFOCOM
2006
IEEE
14 years 3 months ago
Policy-Based Resource Management and Service Provisioning in GMPLS Networks
— Emerging network applications tend to be built over heterogeneous network resources spanning multiple management domains. Many such applications have dynamic demands for dedica...
Xi Yang, Tom Lehman, Chris Tracy, Jerry Sobieski, ...
IWCMC
2006
ACM
14 years 3 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan