Sciweavers

4908 search results - page 629 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
16 years 29 days ago
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
Artur Alves Pessoa, Marcus Poggi de Aragão,...
BROADNETS
2006
IEEE
16 years 28 days ago
Minimum Rejection Scheduling in All-Photonic Networks
Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to per...
Nahid Saberi, Mark Coates
BROADNETS
2006
IEEE
16 years 28 days ago
A Secure Programming Paradigm for Network Virtualization
—The central paradigm of today’s successful Internet is to keep the network core simple and move complexity towards the network end points. Unfortunately, this very paradigm li...
Ana Milanova, Sonia Fahmy, David Musser, Büle...
CCGRID
2006
IEEE
16 years 28 days ago
Integrating Gridcomputing and Metamodeling
Simulation and optimization of complex mechanical and electronical systems is a very time consuming and computationally intensive task. Therefore, metamodeling techniques are ofte...
Dirk Gorissen, Wouter Hendrickx, Karel Crombecq, T...
CIBCB
2006
IEEE
16 years 28 days ago
A Swarm Intelligence Based Algorithm for Proteomic Pattern Detection of Ovarian Cancer
- The advanced protein profiling technologies can simultaneously resolve and analyze multiple proteins. Evaluating multiple proteins will be essential to establish signature proteo...
Yan Meng