Sciweavers

1725 search results - page 233 / 345
» Relaxed genetic programming
Sort
View
CP
2009
Springer
15 years 4 months ago
A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem
In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in o...
Helmut Simonis
KBSE
2009
IEEE
15 years 4 months ago
Cache-Based Model Checking of Networked Applications: From Linear to Branching Time
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...
ICC
2008
IEEE
161views Communications» more  ICC 2008»
15 years 4 months ago
Joint Power Control and Link Scheduling in Wireless Networks for Throughput Optimization
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
Liqun Fu, Soung Chang Liew, Jianwei Huang
ICC
2008
IEEE
121views Communications» more  ICC 2008»
15 years 4 months ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen
ICPR
2008
IEEE
15 years 4 months ago
Medical image segmentation via min s-t cuts with sides constraints
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
Jiun-Hung Chen, Linda G. Shapiro