Sciweavers

5114 search results - page 407 / 1023
» Complex networks
Sort
View

Publication
303views
14 years 2 months ago
Evolutionary synthesis of analog networks
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
Claudio Mattiussi
ICNP
2006
IEEE
15 years 10 months ago
Robust Path-Vector Routing Despite Inconsistent Route Preferences
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...
Aaron D. Jaggard, Vijay Ramachandran
QSHINE
2005
IEEE
15 years 10 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
INFOCOM
2012
IEEE
13 years 7 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
OOPSLA
2009
Springer
15 years 9 months ago
Fault-based combinatorial testing of web services
Abstract—The Internet houses diverse applications (i.e., banking, networking, etc.), commonly implemented as web services. Web services are flexible but can become complex, maki...
Bellanov S. Apilli