Sciweavers

3528 search results - page 203 / 706
» A New Approach to Planning in Networks
Sort
View
ICTAI
1996
IEEE
15 years 10 months ago
Applying a Mutation-based Genetic Algorithm to Processor Configuration Problems
The Processor Configuration Problem (PCP) is a Constraint Optimization Problem. The task is to link up a finite set of processors into a network, while minimizing the maximum dist...
T. L. Lau, Edward P. K. Tsang
MOBIQUITOUS
2007
IEEE
16 years 26 days ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
OL
2010
128views more  OL 2010»
15 years 5 months ago
A biased random-key genetic algorithm for road congestion minimization
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...
Luciana S. Buriol, Michael J. Hirsch, Panos M. Par...
BMCBI
2008
97views more  BMCBI 2008»
15 years 6 months ago
Interrogating domain-domain interactions with parsimony based approaches
Background: The identification and characterization of interacting domain pairs is an important step towards understanding protein interactions. In the last few years, several met...
Katia S. Guimarães, Teresa M. Przytycka
206
Voted
ISORC
2005
IEEE
16 years 5 days ago
Automated Model Checking and Testing for Composite Web Services
Web Services form a new distributed computing paradigm. Collaborative verification and validation are important when Web Services from different vendors are integrated together to...
Hai Huang, Wei-Tek Tsai, Raymond A. Paul, Yinong C...