Sciweavers

616 search results - page 79 / 124
» Hybrid Numerical Optimization for Combinatorial Network Prob...
Sort
View
CP
2009
Springer
13 years 8 months ago
Lazy Clause Generation Reengineered
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
Thibaut Feydy, Peter J. Stuckey
NOMS
2008
IEEE
14 years 5 months ago
A novel approach to bottleneck analysis in networks
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
Nikhil Shetty, Assane Gueye, Jean C. Walrand
CISS
2008
IEEE
14 years 5 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
14 years 5 months ago
SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan...
MIDDLEWARE
2009
Springer
14 years 5 months ago
MANETKit: Supporting the Dynamic Deployment and Reconfiguration of Ad-Hoc Routing Protocols
The innate dynamicity and complexity of mobile ad-hoc networks (MANETs) has resulted in numerous ad-hoc routing protocols being proposed. Furthermore, numerous variants and hybrids...
Rajiv Ramdhany, Paul Grace, Geoff Coulson, David H...