Sciweavers

2523 search results - page 276 / 505
» Objective: In Minimum Context
Sort
View
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
16 years 24 days ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
CDVE
2007
Springer
136views Visualization» more  CDVE 2007»
16 years 23 days ago
Cooperative Validation in Distributed Control Systems Design
The team of engineers designing and implementing distributed control system software must communicate within a multidisciplinary environment. One of the main problems is the intera...
Dariusz Choinski, Mieczyslaw Metzger, Witold Nocon...
APSEC
2006
IEEE
16 years 20 days ago
Cohesion Analysis in Linux Kernel
It is widely accepted that strong coupling such as common coupling should be used with caution among modules. Linux kernel is analyzed in terms of these common coupling instances ...
K. Vinay Kumar Reddy, D. Janakiram
BROADNETS
2006
IEEE
16 years 20 days ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
GLOBECOM
2006
IEEE
16 years 20 days ago
Adaptive Multi-Copy Routing for Intermittently Connected Mobile Ad Hoc Networks
— Intermittently Connected Mobile Ad Hoc Networks (ICMANs) are mobile networks in which complete source-todestination paths do not exist most of the time because of their sparse ...
Zhuoqun Li, Lingfen Sun, Emmanuel C. Ifeachor